//
// main.cpp
// data structure
//
// Created by 戴志扬 on 16/9/7.
// Copyright © 2016年 sky.dai. All rights reserved.
//
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include<math.h>
using namespace std;
vector<int>length;
bool cmp(const int a,const int b)
{
return a<b;
}
int main()
{
int n,p,i,lens,middle;
cin>>n;
while (n--)
{
cin>>p; //p stands for total relatives
for(i=0;i<p;++i)
{
cin>>lens;
length.push_back(lens);
}
sort(length.begin(),length.end(),cmp);
if(p&1)
{
middle = length[(p+1)/2-1];
}
else middle = length[p/2-1];
int sum = 0;
for(i=0;i<p;++i)
{
sum+=abs(middle-length[i]);
}
cout<<sum<<endl;
length.clear();
}
return 0;
}