Submission #924059

#	Time	Username	Problem	Language	Result	Execution time	Memory
924059		Danusan	Best Place (NOI17_bestplace)	Pypy 3	100 / 100	208 ms	32116 KiB

bestplace

def median(list,num):
  list.sort()
  if num%2!=0:
    return list[num//2]
  return (list[num//2]+list[(num//2)-1])//2

num=int(input())
x=[]
y=[]
for i in range(num):
  xn, yn = map(int, input().split())
  x.append(xn)
  y.append(yn)
print(median(x,num),median(y,num))

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