1.

/**
 * FWP, Ausgewählte Probleme aus dem ACM Programming Contest, WS10/11 
 * Problem: 10041 - Vito's Family 
 * Link: http://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=982
 * 
 * @author Manuel Hager
 * @version 1.0, 10/28/2010
 * 
 * Method : Ad-Hoc
 * Status : Accepted
 * Runtime: 0.044
 */

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

int main(int argc, char *argv[])
{
	unsigned int numberOfTests, relatives, tmp, half, currVal, sum;
	cin >> numberOfTests;
	
	for(int testcases = 0; testcases < numberOfTests; testcases++)
	{
		cin >> relatives;
		int streetNumbers[relatives];
		
		if(relatives & 1) { //odd
			for(int i = 0; i < relatives; i++) {
				cin >> streetNumbers[i];
			}
			sort(streetNumbers, streetNumbers+relatives);
			
			half = (relatives - 1) >> 1;
			currVal = streetNumbers[half];
			sum = 0;
			
			for(int i = 0; i < half; i++) {
				sum += (currVal - streetNumbers[i]);
			}
			for(int i = half + 1; i < relatives; i++) {
				sum += (streetNumbers[i] - currVal);
			}
			cout << sum << endl;
		}
		else { //even
			for(int i = 0; i < relatives; i++) {
				cin >> tmp;
				streetNumbers[i] = tmp * 10;
			}
			sort(streetNumbers, streetNumbers+relatives);
			
			half = relatives >> 1;
			currVal = (streetNumbers[half] - streetNumbers[half - 1]) >> 1;
			sum = 0;
			
			for(int i = 0; i < half; i++) {
				sum += (currVal - streetNumbers[i]);
			}
			for(int i = half; i < relatives; i++) {
				sum += (streetNumbers[i] - currVal);
			}
			cout << sum / 10 << endl;
		}
	}
	return 0;
}