货仓选址

http://icpc.upc.edu.cn/problem.php?cid=1430&pid=11

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int n, a[100006],i;
long long ans;
int main() {
	scanf("%d",&n);
	for (i = 1; i <= n; i++) scanf("%d", &a[i]);
	sort(a + 1, a + n + 1);
	for (i = 1; i <= n / 2; i++)
		ans += a[n-i+1]-a[i];
	printf("%d\n",ans);
}