2011.cpp

哈尔滨工业大学ACM 竞赛网上在线试题集锦的源代码

/*  This Code is Submitted by wywcgs for Problem 2011 on 2005-09-30 at 12:58:57 */ 
#include <cstdio>
#include <algorithm>
#define  MAX  10000
using namespace std;

int main()
{
	int n, i, p;
	long long peoplex[MAX], peopley[MAX], peoplez[MAX];
	long long mx, my, mz;
	long long dis;
	
	while(scanf("%d", &n) == 1) {
		for(i = 0; i < n; i++) {
			scanf("%lld %lld %lld", &peoplex[i], &peopley[i], &peoplez[i]);
		}
		sort(peoplex, peoplex+n);
		sort(peopley, peopley+n);
		sort(peoplez, peoplez+n);
		dis = 0;
		p = n / 2;
		mx = peoplex[p];
		my = peopley[p];
		mz = peoplez[p];
		for(i = 0; i < n; i++) {
			if(i < p) {
				dis += mx-peoplex[i] + my - peopley[i]+ mz - peoplez[i];
			} else {
				dis -= mx-peoplex[i] + my - peopley[i]+ mz - peoplez[i];
			}
		}
		printf("%lld\n", dis);
	}
	
	return 0;
}