#include <bits/stdc++.h>
using namespace std;
long long N;
deque<pair<long long, long long> > dqq;
signed main() {
  long long n;
  cin >> n;
  long long a[n], b[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    dqq.push_back(make_pair(a[i], 1));
  }
  for (long long i = 0; i < n; i++) {
    cin >> b[i];
    dqq.push_back(make_pair(b[i], 2));
  }
  sort(dqq.rbegin(), dqq.rend());
  long long x = 0;
  long long A = 0, B = 0;
  while (!dqq.empty()) {
    pair<long long, long long> T = dqq.front();
    if (x % 2 == 0) {
      if (T.second == 1) {
        A += (T.first);
      }
      dqq.pop_front();
    }
    if (x % 2 != 0) {
      if (T.second == 2) {
        B += (T.first);
      }
      dqq.pop_front();
    }
    x++;
  }
  long long y = A - B;
  cout << y << '\n';
}
