hutc-邮局选址问题-参考代码

#include <stdio.h>
int cmp(const void *a, const void *b)
{
return (*(int *)a - *(int *)b);
}
int x[10000], y[10000];
int main()
{
int n, i, j, t, xm, ym, sum, x1, y1;
while(scanf("%d", &n) != EOF)
{
sum = 0;
for(i = 0; i < n; i++)
scanf("%d %d", &x[i], &y[i]);
qsort(x, n, sizeof(x[0]), cmp);
qsort(y, n, sizeof(y[0]), cmp);
xm = x[n / 2];
ym = y[n / 2];
for(i = 0; i < n; i++)
{
x1 = x[i] - xm;
if(x1 < 0) x1 = -x1;
y1 = y[i] - ym;
if(y1 < 0) y1 = -y1;
sum += x1 + y1;
}
printf("%d\n", sum);
}
return 0;
}