제출 #7734

#제출 시각아이디문제언어결과실행 시간메모리
7734gs14004점 모으기 (KOI13_collect)C++98
24 / 24
36 ms1868 KiB
#include <cstdio> #include <algorithm> #include <cstdlib> int x[100000],y[100000]; int main(){ int m,n; scanf("%d %d",&m,&n); for (int i=0; i<n; i++) { scanf("%d %d",&x[i],&y[i]); } std::sort(x,x+n); std::sort(y,y+n); int px=x[n/2],py=y[n/2],res=0; for (int i=0; i<n; i++) { res+=abs(px-x[i])+abs(py-y[i]); } printf("%d",res); }
#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...