# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4602 | Namnamseo | 지능형 기차 2 (KOI11_train2) | C++98 | 0 ms | 0 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>
int max(int x,int y)
{
return (x>y)?x:y;
}
int main(int a,char** b)
{
int x=0;
int p,q;
int ans=-1;
for(a=10;a>0;a--)
{
scanf("%d %d",&p,&q);
x+=q; ans=max(ans,x);
x-=p;
}
printF("%d",ans);
return 0;
}