a737. 10041 - Vito's family -- UVa10041 | From: [182.233.7.217] | 發表日期 : 2023-09-20 09:56

#include<iostream>

#include<algorithm>

#include<cmath>

using namespace std;

int main() {

int time = 0;

cin >> time;

for (int i = 0; i < time; i++) {

int num = 0;

int a[30000 ];

int r = 0;

int sum=0;

cin >> num;

for (int j = 1; j <=num; j++) {

cin >> a[j];

}

sort(a, a + num+1);

r = (num + 1) / 2;

int mid = a[r];

for (int j = 1; j <=num; j++) {

sum += abs(a[j] -mid);

}

cout << sum<<endl;

}

 

}