//uva10041 #include <iostream> #include <vector> #include <algorithm> #include <cmath> using namespace std; int main() { int n; while (cin >> n) { for (int i = 0 ; i < n ; i++) { int r, tmp, distance = 0; vector<int> s; cin >> r; for (int j = 0 ; j < r ; j++) { cin >> tmp; s.push_back(tmp); } sort(s.begin(), s.end()); int index = s.size() / 2; for (int j = 0;j < r;j++) { distance += abs(s[j] - s[index]); } cout << distance << endl; } } return 0; }