제출 #924050

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
924050		Danusan	Best Place (NOI17_bestplace)	Cpython 3	0 / 100	12 ms	3052 KiB

bestplace

import math

num=int(input())
x=[]
y=[]
xval={}
yval={}
for i in range(num):
  x[i], y[i] = map(int, input().split())
for i in range(num):
  for j in range(i+1,num):
    xval[x[i]]=xval.get(x[i],0) + abs(x[i]-x[j])
    xval[x[j]]=xval.get(x[j],0) + abs(x[i]-x[j])
for i in range(num):
  for j in range(i+1,num):
    yval[y[i]]= yval.get(y[i],0) + abs(y[i]-y[j])
    yval[y[j]]= yval.get(y[j],0) + abs(y[i]-y[j])
print(min(xval, key=xval.get),min(yval, key=yval.get))

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