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 <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int n, m, y[100001], x[100001], ans;
void input(void)
{
    int i;
    scanf("%d %d",&n,&m);
    for(i=1 ; i<=m ; i++)
        scanf("%d %d",&y[i],&x[i]);
    sort(y+1,y+m+1);
    sort(x+1,x+m+1);
}
void process(void)
{
    int i;
    for(i=1 ; i<=m ; i++)
        ans+=abs(y[(m+1)/2]-y[i])+abs(x[(m+1)/2]-x[i]);
}
void output(void)
{
    printf("%d",ans);
}
int main(void)
{
    input();
    process();
    output();
    return 0;
}
| # | 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... |