# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13434 | hjjang45 | 지능형 기차 2 (KOI11_train2) | C++98 | 0 ms | 1084 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <stdlib.h>
int main()
{
int in[20],ex[20],max=0,sum=0,i,j;
for(i=1;i<=10;i++)
{
scanf("%d %d",&ex[i],&in[i]);
}
for(i=1;i<=10;i++)
{
sum = sum - ex[i];
sum = sum + in[i];
if(max < sum)
{
max = sum;
}
}
printf("%d",max);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |