This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |