题目衔接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=982
属于简单题,代码如下:
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define maxn 500+10
int data[maxn];
int main()
{
int T;
cin>>T;
while(T--)
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>data[i];
sort(data+1,data+n+1);
int sum = 0,t = (n+1)/2; //线性关系,取中间值得到最小值
for(int i =1;i<=n;i++)
sum += abs(data[i]-data[t]);
cout<<sum<<endl;
}
return 0;
}