#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long int INFL = 1e18;
int main(void) {
  cin.sync_with_stdio(false), cin.tie(NULL);
  priority_queue<int> pq1, pq2;
  int N;
  cin >> N;
  int val;
  for (int i = 0; i < N; i++) {
    cin >> val;
    pq1.push(val);
  }
  for (int i = 0; i < N; i++) {
    cin >> val;
    pq2.push(val);
  }
  long long A = 0, B = 0;
  bool flag = true;
  while (!pq1.empty() || !pq2.empty()) {
    auto& mine = (flag) ? pq1 : pq2;
    auto& aite = (flag) ? pq2 : pq1;
    auto& mysc = (flag) ? A : B;
    auto& aisc = (flag) ? B : A;
    if (!mine.empty() && !aite.empty()) {
      if (mine.top() >= aite.top()) {
        mysc += mine.top();
        mine.pop();
      } else
        aite.pop();
    } else if (!mine.empty()) {
      mysc += mine.top();
      mine.pop();
    } else {
      aite.pop();
    }
    flag = !flag;
  }
  cout << A - B << '\n';
  return 0;
}
