제출 #1839

#제출 시각아이디문제언어결과실행 시간메모리
1839alephnull점 모으기 (KOI13_collect)C++98
24 / 24
50 ms1592 KiB
#include <cstdio> #include <algorithm> using namespace std; int main(){ int n,m; scanf("%d %d",&n,&m); int x[m],y[m]; for(int i=0;i<m;i++) scanf("%d %d",x+i,y+i); sort(x,x+m); sort(y,y+m); int xm=x[m/2],ym=y[m/2]; int sumx=0,sumy=0; for(int i=0;i<m;i++){ sumx+=abs(xm-x[i]); sumy+=abs(ym-y[i]); } printf("%d",sumx+sumy); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...