#include <bits/stdc++.h>
using namespace std;
int n;
multiset<int> a, b;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    a.insert(x);
  }
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    b.insert(x);
  }
  long long int A = 0, B = 0;
  int turn = 0;
  while ((!a.empty()) || (!b.empty())) {
    if (!turn) {
      if (a.empty()) {
        b.erase(--b.end());
      } else if (b.empty()) {
        A += *a.rbegin();
        a.erase(--a.end());
      } else {
        int amaxi = *a.rbegin();
        int bmaxi = *b.rbegin();
        if (amaxi >= bmaxi) {
          A += amaxi;
          a.erase(a.find(amaxi));
        } else {
          b.erase(b.find(bmaxi));
        }
      }
    } else {
      if (b.empty()) {
        a.erase(--a.end());
      } else if (a.empty()) {
        B += *b.rbegin();
        b.erase(--b.end());
      } else {
        int bmaxi = *b.rbegin();
        int amaxi = *a.rbegin();
        if (bmaxi >= amaxi) {
          B += bmaxi;
          b.erase(b.find(bmaxi));
        } else {
          a.erase(a.find(amaxi));
        }
      }
    }
    turn ^= 1;
  }
  printf("%lld", A - B);
  return 0;
}
