soldier.cpp

设计一个算法

#include<iostream>
#include<algorithm>
#include<fstream>
#include<cmath>
using namespace std;
int main()
{
	int n,i,num=0,mid_x,mid_y;
	ifstream input("input.txt");
	ofstream output("output.txt");
	input>>n;
	int *x=new int [n];
	int *y=new int [n];
	for(i=0;i<n;i++)
		input>>x[i]>>y[i];
	sort(y,y+n);
	mid_y=y[n/2];
	for(i=0;i<n;i++)
		num+=(long)fabs(y[i]-mid_y);//cout<<num<<endl;
	sort(x,x+n);
	mid_x=x[n/2];
	for(i=0;i<n;i++)
		num+=(long)fabs(x[i]-(mid_x-n/2+i));
	output<<num<<endl;
	delete []x;
	delete []y;
	return 0;
}