oj.uz

Submission #9095

# Submission time Handle Problem Language Result Execution time Memory
9095 2014-09-27T11:53:13 Z kcm1700 Penalty calculation (kriii2_PE) C++14
4 / 4
 0 ms 1204 KB 
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
  int n;
  scanf("%d",&n);
  vector<int> scores;
  vector<int> times;
  for(int i = 0; i < n; i++) {
    int a,b;
    scanf("%d%d",&a,&b);
    scores.push_back(b);
    times.push_back(a);
  }
  int ind = max_element(scores.begin(),scores.end()) - scores.begin();
  if (scores[ind] == 0){
    printf("0\n");
  } else {
    printf("%d\n", ind * 20 + times[ind]);
  }
  return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1204 KB Output is correct
2 Correct 0 ms 1204 KB Output is correct
3 Correct 0 ms 1204 KB Output is correct
4 Correct 0 ms 1204 KB Output is correct
5 Correct 0 ms 1204 KB Output is correct
6 Correct 0 ms 1204 KB Output is correct
7 Correct 0 ms 1204 KB Output is correct
8 Correct 0 ms 1204 KB Output is correct
9 Correct 0 ms 1204 KB Output is correct
10 Correct 0 ms 1204 KB Output is correct
11 Correct 0 ms 1204 KB Output is correct
12 Correct 0 ms 1204 KB Output is correct
13 Correct 0 ms 1204 KB Output is correct
14 Correct 0 ms 1204 KB Output is correct
15 Correct 0 ms 1204 KB Output is correct
16 Correct 0 ms 1204 KB Output is correct
17 Correct 0 ms 1204 KB Output is correct
18 Correct 0 ms 1204 KB Output is correct
19 Correct 0 ms 1204 KB Output is correct
20 Correct 0 ms 1204 KB Output is correct
21 Correct 0 ms 1204 KB Output is correct
22 Correct 0 ms 1204 KB Output is correct
23 Correct 0 ms 1204 KB Output is correct
24 Correct 0 ms 1204 KB Output is correct
25 Correct 0 ms 1204 KB Output is correct
26 Correct 0 ms 1204 KB Output is correct
27 Correct 0 ms 1204 KB Output is correct
28 Correct 0 ms 1204 KB Output is correct
29 Correct 0 ms 1204 KB Output is correct
30 Correct 0 ms 1204 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1204 KB Output is correct
2 Correct 0 ms 1204 KB Output is correct
3 Correct 0 ms 1204 KB Output is correct
4 Correct 0 ms 1204 KB Output is correct
5 Correct 0 ms 1204 KB Output is correct
6 Correct 0 ms 1204 KB Output is correct
7 Correct 0 ms 1204 KB Output is correct
8 Correct 0 ms 1204 KB Output is correct
9 Correct 0 ms 1204 KB Output is correct
10 Correct 0 ms 1204 KB Output is correct
11 Correct 0 ms 1204 KB Output is correct
12 Correct 0 ms 1204 KB Output is correct
13 Correct 0 ms 1204 KB Output is correct
14 Correct 0 ms 1204 KB Output is correct
15 Correct 0 ms 1204 KB Output is correct
16 Correct 0 ms 1204 KB Output is correct
17 Correct 0 ms 1204 KB Output is correct
18 Correct 0 ms 1204 KB Output is correct
19 Correct 0 ms 1204 KB Output is correct
20 Correct 0 ms 1204 KB Output is correct
21 Correct 0 ms 1204 KB Output is correct
22 Correct 0 ms 1204 KB Output is correct
23 Correct 0 ms 1204 KB Output is correct
24 Correct 0 ms 1204 KB Output is correct
25 Correct 0 ms 1204 KB Output is correct
26 Correct 0 ms 1204 KB Output is correct
27 Correct 0 ms 1204 KB Output is correct
28 Correct 0 ms 1204 KB Output is correct
29 Correct 0 ms 1204 KB Output is correct
30 Correct 0 ms 1204 KB Output is correct