uva10041 - Vito's Family(求中位数)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 505;
int s
;
int main() {
int cas;
scanf("%d", &cas);
while (cas--) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &s[i]);
sort(s, s + n);
int mid = n / 2;
int cnt = 0;
for (int i = 0; i < n; i++)
cnt += abs(s[mid] - s[i]);
printf("%d\n", cnt);
}
return 0;
}