Submission #598317

#	Time	Username	Problem	Language	Result	Execution time	Memory
598317		KK_1729	Best Place (NOI17_bestplace)	Cpython 3	100 / 100	307 ms	14032 KiB

bestplace

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))

• Subtask 1: 3 / 3
• Subtask 2: 20 / 20
• Subtask 3: 28 / 28
• Subtask 4: 13 / 13
• Subtask 5: 17 / 17
• Subtask 6: 19 / 19