// 想定解
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;


int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        vector<int> A(N);
        for (auto &x : A) cin >> x;
        sort(A.begin(), A.end());

        int all = A.back();
        for (int i = N - 1; i; --i) A[i] -= A[i - 1];

        priority_queue<int> pq;

        int last = 0;
        for (int i = 0; i < N; ++i) {
            pq.push(A[i]);
            if (i % 2 == 0) {
                last += pq.top();
                pq.pop();
            }
        }
        cout << ((N & 1) ? last : all - last) << '\n';
    }
}