Submission #1080

#TimeUsernameProblemLanguageResultExecution timeMemory
1080tncks0121점 모으기 (KOI13_collect)C++98
24 / 24
40 ms1668 KiB
#include <stdio.h> #include <algorithm> using namespace std; const int M=100100; int n,m,x[M],y[M],X,Y; int s; int main() { int i; scanf("%d%d",&n,&m); for(i=0;i<m;++i) scanf("%d%d",&x[i],&y[i]); sort(x,x+m); sort(y,y+m); X=x[m/2]; Y=y[m/2]; s=0; for(i=0;i<m/2;++i) s+=(X-x[i])+(Y-y[i]); for(;i<m;++i) s+=(x[i]-X)+(y[i]-Y); printf("%d\n",s); return 0; }
#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...