PostOffice
Time Limit: 1000MS | Memory Limit: 65535KB |
Submissions: 200 | Accepted: 54 |
Sample Input
5 1 2 2 2 1 3 3 -2 3 3
Sample Output
10
中位數問題!
#include<iostream>
#include<algorithm>
using namespace std;
int f(int a)
{
return
a<0?-a:a;
}
int main()
{
int i,j,k,n;
cin>>n;
int *a=new int[n];
int *b=new int[n];
for(i=0;i<n;i++)
cin>>a[i]>>b[i];
sort(a,a+n);
sort(b,b+n);
j=a[n/2];
k=b[n/2];
int l=0;
for(i=0;i<n;i++)
l+=f(a[i]-j)+f(b[i]-k);
cout<<l<<endl;
}