/ SeriousOJ /

Record Detail

Wrong Answer


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

Code

#include<stdio.h>
int main()
{
    int x, y[999], z[999], a=0, b=0, c=0, d=0;
    scanf("%d", &x);
    for(int i=0; i<x; i++)
    {
        scanf("%d", &y[i]);
    }
    for(int i=0; i<x; i++)
    {
        scanf("%d", &z[i]);
    }
    for(int i=0; i<x; i++)
    {
        if(y[i]>y[i+1])
        {
            a=a+y[i];
        }
    }
    for(int i=0; i<x; i++)
    {
        if(z[i]>z[i+1])
        {
            b=b+z[i];
        }
    }
    if(a==b)
    {
        printf("%d", a);
    }
    else
    {
         for(int i=0; i<x; i++)
    {
        if(y[i]>y[i+1])
        {
            if(y[i]==a)
            {
                continue;
            }
            else
            {
            c=c+y[i];
            }
        }
    }
    for(int i=0; i<x; i++)
    {
        if(z[i]>z[i+1])
        {
           if(z[i]==b)
            {
                continue;
            }
            else
            {
            d=d+y[i];
            }
        }
    }
    if(c==d)
    {
        printf("%d", c);
    }
    }
    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:17:26
Judged At
2025-09-01 06:17:26
Judged By
Score
0
Total Time
0ms
Peak Memory
284.0 KiB