제출 #5208

#제출 시각아이디문제언어결과실행 시간메모리
5208ansol4328점 모으기 (KOI13_collect)C++98
24 / 24
36 ms1868 KiB
#include<stdio.h> #include<algorithm> #include<stdlib.h> int a[100002], b[100002]; int main() { int n, m, sum=0; int i, x, y; scanf("%d %d",&n,&m); for(i=1 ; i<=m ; i++) scanf("%d %d",&a[i],&b[i]); std::sort(a+1,a+1+m); std::sort(b+1,b+1+m); x=a[m/2+m%2], y=b[m/2+m%2]; for(i=1 ; i<=m ; i++) sum+=abs(a[i]-x)+abs(b[i]-y); printf("%d",sum); 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...