#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
  long long T = 1;
  while (T--) {
    long long n;
    cin >> n;
    vector<long long> a(n), b(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    long long as = 0, bs = 0;
    sort(a.begin(), a.end(), greater<long long>());
    sort(b.begin(), b.end(), greater<long long>());
    a.push_back(-INF);
    b.push_back(-INF);
    long long ai = 0, bi = 0;
    bool turn = true;
    while (ai != (a.size() - 1) or bi != (b.size() - 1)) {
      if (a[ai] > b[bi]) {
        if (turn) as += a[ai];
        ai++;
      } else {
        if (!turn) bs += b[bi];
        bi++;
      }
      turn = !turn;
    }
    cout << as - bs << endl;
  }
}
