oj.uz

Submission #9076

# Submission time Handle Problem Language Result Execution time Memory
9076 2014-09-27T11:22:57 Z roott76 Penalty calculation (kriii2_PE) C++
4 / 4
 0 ms 1676 KB 
/*
#include <stdio.h>
int main()
{
	printf("%s\n%s\n", "paper", "scissors");
}
*/

#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
	int n, t[101], s[101];
	cin >> n;
	for(int i=0; i<n; i++) cin >> t[i] >> s[i];

	int max = 0;
	for(int i=0; i<n; i++)
	{
		if(max < s[i]) max = s[i];
	}

	int time[101], cnt = 0;
	for(int i=0; i<n; i++)
	{
		if(max == s[i]) time[cnt++] = t[i];
	}

	sort(time, time+cnt);

	int index;
	for(int i=0; i<n; i++)
	{
		if(time[0] == t[i]) index = i;
	}
	
	int P;
	if(!max) P = 0;
	else P = t[index] + index*20;
	cout << P << endl;
}

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