#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <deque>
#include <utility>
#include <bitset>
#include <limits.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef long double llf;
typedef unsigned long long llu;
int cnt[10], tm[10];
int main(int argc, char * argv[]) {
int n;
scanf("%d", &n);
int maxs = -1;
for(int i = 1; i <= n; i++) {
int t, s; scanf("%d%d", &t, &s);
maxs = max(maxs, s);
if(!cnt[s]) cnt[s] = i, tm[s] = t;
}
if(maxs > 0)
printf("%d\n", tm[maxs] + (cnt[maxs] - 1) * 20);
else
puts("0");
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
0 ms |
1088 KB |
Output is correct |
5 |
Correct |
0 ms |
1088 KB |
Output is correct |
6 |
Correct |
0 ms |
1088 KB |
Output is correct |
7 |
Correct |
0 ms |
1088 KB |
Output is correct |
8 |
Correct |
0 ms |
1088 KB |
Output is correct |
9 |
Correct |
0 ms |
1088 KB |
Output is correct |
10 |
Correct |
0 ms |
1088 KB |
Output is correct |
11 |
Correct |
0 ms |
1088 KB |
Output is correct |
12 |
Correct |
0 ms |
1088 KB |
Output is correct |
13 |
Correct |
0 ms |
1088 KB |
Output is correct |
14 |
Correct |
0 ms |
1088 KB |
Output is correct |
15 |
Correct |
0 ms |
1088 KB |
Output is correct |
16 |
Correct |
0 ms |
1088 KB |
Output is correct |
17 |
Correct |
0 ms |
1088 KB |
Output is correct |
18 |
Correct |
0 ms |
1088 KB |
Output is correct |
19 |
Correct |
0 ms |
1088 KB |
Output is correct |
20 |
Correct |
0 ms |
1088 KB |
Output is correct |
21 |
Correct |
0 ms |
1088 KB |
Output is correct |
22 |
Correct |
0 ms |
1088 KB |
Output is correct |
23 |
Correct |
0 ms |
1088 KB |
Output is correct |
24 |
Correct |
0 ms |
1088 KB |
Output is correct |
25 |
Correct |
0 ms |
1088 KB |
Output is correct |
26 |
Correct |
0 ms |
1088 KB |
Output is correct |
27 |
Correct |
0 ms |
1088 KB |
Output is correct |
28 |
Correct |
0 ms |
1088 KB |
Output is correct |
29 |
Correct |
0 ms |
1088 KB |
Output is correct |
30 |
Correct |
0 ms |
1088 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1088 KB |
Output is correct |
2 |
Correct |
0 ms |
1088 KB |
Output is correct |
3 |
Correct |
0 ms |
1088 KB |
Output is correct |
4 |
Correct |
0 ms |
1088 KB |
Output is correct |
5 |
Correct |
0 ms |
1088 KB |
Output is correct |
6 |
Correct |
0 ms |
1088 KB |
Output is correct |
7 |
Correct |
0 ms |
1088 KB |
Output is correct |
8 |
Correct |
0 ms |
1088 KB |
Output is correct |
9 |
Correct |
0 ms |
1088 KB |
Output is correct |
10 |
Correct |
0 ms |
1088 KB |
Output is correct |
11 |
Correct |
0 ms |
1088 KB |
Output is correct |
12 |
Correct |
0 ms |
1088 KB |
Output is correct |
13 |
Correct |
0 ms |
1088 KB |
Output is correct |
14 |
Correct |
0 ms |
1088 KB |
Output is correct |
15 |
Correct |
0 ms |
1088 KB |
Output is correct |
16 |
Correct |
0 ms |
1088 KB |
Output is correct |
17 |
Correct |
0 ms |
1088 KB |
Output is correct |
18 |
Correct |
0 ms |
1088 KB |
Output is correct |
19 |
Correct |
0 ms |
1088 KB |
Output is correct |
20 |
Correct |
0 ms |
1088 KB |
Output is correct |
21 |
Correct |
0 ms |
1088 KB |
Output is correct |
22 |
Correct |
0 ms |
1088 KB |
Output is correct |
23 |
Correct |
0 ms |
1088 KB |
Output is correct |
24 |
Correct |
0 ms |
1088 KB |
Output is correct |
25 |
Correct |
0 ms |
1088 KB |
Output is correct |
26 |
Correct |
0 ms |
1088 KB |
Output is correct |
27 |
Correct |
0 ms |
1088 KB |
Output is correct |
28 |
Correct |
0 ms |
1088 KB |
Output is correct |
29 |
Correct |
0 ms |
1088 KB |
Output is correct |
30 |
Correct |
0 ms |
1088 KB |
Output is correct |