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<cstdio>
int h[105][2];
int main ()
{
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++) scanf("%d %d", &h[i][0], &h[i][1]);
int m = -1, p, pp;
for(int i = 0; i < n; i++) {
if(m < h[i][0]) { m = h[i][0]; p = i + 1; pp = h[i][1]; }//p = h[i][1]; }
}
if(pp == 0) printf("0");
else printf("%d", m + (p - 1) * 20);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |