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 pro[5];
int t[105], s[105];
int main(){
int n;
scanf("%d", &n);
for(int i=1; i<=n; i++){
scanf("%d %d", t+i, s+i);
if( !pro[s[i]] )
pro[s[i]] = i;
}
int ans = 0;
if( pro[4] )
ans = t[pro[4]] + (pro[4]-1)*20;
else if( pro[1] )
ans = t[pro[1]] + (pro[1]-1)*20;
else
ans = 0;
printf("%d\n", ans);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |