Submission #9027

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
9027	2014-09-27T10:48:41 Z	joonas	Penalty calculation (kriii2_PE)	C++	4 / 4	0 ms	1088 KB

PE

#include <cstdio>
int main(){
	int T[101], S[101];
	int i, N, P=0, maxIndex=-1, maxS=0;
	scanf("%d", &N);
	for(i=0; i < N; ++i){
		scanf("%d %d", &T[i], &S[i]);
		if(S[i] > maxS){
			maxIndex = i;
			maxS = S[i];
		}
	}
	P = maxIndex < 0 ? 0 : T[maxIndex] + (maxIndex)*20;
	printf("%d", P);
	return 0;
}

Subtask #1

1.0 / 1.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

Subtask #2

3.0 / 3.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