/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 0ms 324.0 KiB
#2 Wrong Answer 0ms 284.0 KiB

Code

#include<stdio.h>
int main()
{
    int x, y=0, a[999], b[999];
    scanf("%d", &x);
    for(int i=0; i<x; i++)
    {
        scanf("%d", &a[i]);
    }
    for(int i=0; i<x; i++)
    {
        scanf("%d", &b[i]);
    }
    for(int i=0; i<x-1; i++)
    {
        for(int j=0; j<x-i-1; j++)
        {
            if(a[j]>a[j+1])
            {
                int temp=a[j];
                a[j]=a[j+1];
                a[j+1]=temp;
            }
        }
        for(int j=0; j<x-i-1; j++)
        {
            if(b[j]>b[j+1])
            {
                int temp=b[j];
                b[j]=b[j+1];
                b[j+1]=temp;
            }
        }
    }
    for(int i=x-1; i>=0; i--)
    {
        if(a[i]>b[i])
        {
            continue;
        }
        else if(a[i]<b[i])
        {
            continue;
        }
        else if(a[i]==b[i])
        {
            y=a[i];
        }
    }
    printf("%d", y);
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1224 Maximize the max
Contest
LUCC Presents Kick & Code Intra LU Programming Contest
Language
C99 (GCC 13.2.0)
Submit At
2025-09-01 06:31:45
Judged At
2025-09-01 06:31:45
Judged By
Score
0
Total Time
0ms
Peak Memory
324.0 KiB