| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 16588 | gs14004 | Penalty calculation (kriii2_PE) | C++14 | 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 <cstdio>
#include <algorithm>
using namespace std;
int n, t[105], s[105];
int main(){
scanf("%d",&n);
for(int i=0; i<n; i++){
scanf("%d %d",&t[i],&s[i]);
}
int p = max_element(s,s+n) - s;
if(s[p] == 0){
puts("0");
}
else{
printf("%d",t[p] + p * 20);
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
