oj.uz

Submission #9077

# Submission time Handle Problem Language Result Execution time Memory
9077 2014-09-27T11:23:35 Z babo1m Penalty calculation (kriii2_PE) C++
4 / 4
 0 ms 1676 KB 
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#include<vector>
#include<iostream>
#include<map>
using namespace std;
#define MP make_pair
#define REP(i, N) for(int i = 0; i<(N); i++)
const int INF = 987654321;
int N;
struct dap{
	int score;
	int time;
	int ind;
};
bool operator<(const dap& lhs, const dap& rhs){
	if(lhs.score > rhs.score)return true;
	else if(lhs.score < rhs.score)return false;
	if(lhs.time < rhs.time)return true;
	else return false;
}
int main(){
	int numC;
	//scanf("%d ", &numC);
	//while(numC--){
		scanf("%d ", &N);
		vector<dap> score(N);
		REP(i, N){
			scanf("%d %d ", &score[i].time, &score[i].score);
			score[i].ind = i+1;
		}
		sort(score.begin(), score.end());
		if(score[0].score == 0)printf("0\n");
		else{
			printf("%d\n", score[0].time + (score[0].ind - 1)*20);
		}
	//}
	return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
3.0 / 3.0

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