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

void solve(){
  int n;
  cin >> n;
  int n2 = 2*n; 
  vector<int> v(n2);

  for(int i = 0; i < n2; i++) {
      cin >> v[i];
  }

  nth_element(v.begin(), v.begin() + n, v.end());


  long long sum = 0;
  for(int i = 0; i < n; i++) 
      sum -= v[i];
  for(int i = n; i < n2; i++) 
      sum += v[i];
  cout<<sum<<'\n';
}

int main() {
    int t;
    cin >> t;  
    vector<long long> ans;
    while(t--){
        solve();
    }
     
    return 0;
}