def median(a):
n = len(a);a = sorted(a)
if len(a)%2 == 0:return (a[n//2]+a[n//2-1])//2
else:return a[n//2]
n = int(input())
xes = [];yes = []
for _ in range(n):
x, y = map(int, input().split())
xes.append(x);yes.append(y)
print(median(xes), median(yes))
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
2772 KB |
Output is correct |
2 |
Correct |
13 ms |
2772 KB |
Output is correct |
3 |
Correct |
15 ms |
2760 KB |
Output is correct |
4 |
Correct |
13 ms |
2772 KB |
Output is correct |
5 |
Correct |
13 ms |
2772 KB |
Output is correct |
6 |
Correct |
13 ms |
2772 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
2900 KB |
Output is correct |
2 |
Correct |
16 ms |
2816 KB |
Output is correct |
3 |
Correct |
17 ms |
2844 KB |
Output is correct |
4 |
Correct |
16 ms |
2836 KB |
Output is correct |
5 |
Correct |
15 ms |
2852 KB |
Output is correct |
6 |
Correct |
17 ms |
2772 KB |
Output is correct |
7 |
Correct |
15 ms |
2900 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
248 ms |
8612 KB |
Output is correct |
2 |
Correct |
250 ms |
8900 KB |
Output is correct |
3 |
Correct |
247 ms |
9984 KB |
Output is correct |
4 |
Correct |
256 ms |
9784 KB |
Output is correct |
5 |
Correct |
235 ms |
10020 KB |
Output is correct |
6 |
Correct |
239 ms |
10008 KB |
Output is correct |
7 |
Correct |
265 ms |
9992 KB |
Output is correct |
8 |
Correct |
240 ms |
9932 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
2772 KB |
Output is correct |
2 |
Correct |
13 ms |
2844 KB |
Output is correct |
3 |
Correct |
13 ms |
2760 KB |
Output is correct |
4 |
Correct |
13 ms |
2796 KB |
Output is correct |
5 |
Correct |
14 ms |
2772 KB |
Output is correct |
6 |
Correct |
15 ms |
2772 KB |
Output is correct |
7 |
Correct |
15 ms |
2852 KB |
Output is correct |
8 |
Correct |
13 ms |
2828 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
2900 KB |
Output is correct |
2 |
Correct |
16 ms |
2980 KB |
Output is correct |
3 |
Correct |
17 ms |
2968 KB |
Output is correct |
4 |
Correct |
16 ms |
2900 KB |
Output is correct |
5 |
Correct |
16 ms |
2900 KB |
Output is correct |
6 |
Correct |
17 ms |
2860 KB |
Output is correct |
7 |
Correct |
15 ms |
2844 KB |
Output is correct |
8 |
Correct |
15 ms |
2900 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
291 ms |
11948 KB |
Output is correct |
2 |
Correct |
292 ms |
13900 KB |
Output is correct |
3 |
Correct |
249 ms |
13760 KB |
Output is correct |
4 |
Correct |
287 ms |
13196 KB |
Output is correct |
5 |
Correct |
277 ms |
13972 KB |
Output is correct |
6 |
Correct |
289 ms |
13936 KB |
Output is correct |
7 |
Correct |
307 ms |
13908 KB |
Output is correct |
8 |
Correct |
284 ms |
14032 KB |
Output is correct |