Submission #824202

#	Time	Username	Problem	Language	Result	Execution time	Memory
824202		chaithra07	Best Place (NOI17_bestplace)	Cpython 3	100 / 100	234 ms	13188 KiB

bestplace

n=int(input())
lx=[]
ly=[]
for i in range(n):
    x,y=map(int,input().split())
    lx.append(x)
    ly.append(y)
lx.sort()
ly.sort()
print(lx[n//2],ly[n//2],end=" ")

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