#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long INF = 1000LL * 1000 * 1000 * 1000 * 1000 * 1000;
const int inf = 1000 * 1000 * 1000;
const long double PI = acos(-1.0);
const long long mod1 = inf + 7;
const long long mod2 = inf + 9;
const int MAXN = 2001;
const long double EPS = 1e-9;
int hp = 179;
int main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  srand(time(NULL));
  ;
  int n;
  cin >> n;
  vector<int> fs(n);
  vector<int> ss(n);
  for (long long i = 0; i < fs.size(); ++i) cin >> fs[i];
  ;
  for (long long i = 0; i < ss.size(); ++i) cin >> ss[i];
  ;
  sort((fs).begin(), (fs).end());
  sort((ss).begin(), (ss).end());
  long long sum1 = 0, sum2 = 0;
  for (int trn = 0; trn < 2 * n; ++trn) {
    if (trn % 2 == 0) {
      if (!fs.size()) {
        ss.pop_back();
        continue;
      }
      if (!ss.size()) {
        sum1 += fs.back();
        fs.pop_back();
        continue;
      }
      if (fs.back() >= ss.back()) {
        sum1 += fs.back();
        fs.pop_back();
      } else {
        ss.pop_back();
      }
    } else {
      if (!ss.size()) {
        fs.pop_back();
        continue;
      }
      if (!fs.size()) {
        sum2 += ss.back();
        ss.pop_back();
        continue;
      }
      if (ss.back() >= fs.back()) {
        sum2 += ss.back();
        ss.pop_back();
      } else {
        fs.pop_back();
      }
    }
  }
  cout << sum1 - sum2;
}
