#include <bits/stdc++.h>
using namespace std;
template <typename G>
inline void read(G &x) {
  x = 0;
  char c;
  int dau = 1;
  while (!isdigit(c = getchar())) {
    if (c == '-') dau = -1;
  };
  do {
    x = x * 10 + c - '0';
  } while (isdigit(c = getchar()));
  x = dau * x;
}
template <typename G>
inline void write(G x) {
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
template <class T>
inline T min(T a, T b, T c) {
  return min(a, min(b, c));
}
template <class T>
inline T min(T a, T b, T c, T d) {
  return min(a, min(b, c, d));
}
template <class T>
inline T max(T a, T b, T c) {
  return max(a, max(b, c));
}
template <class T>
inline T max(T a, T b, T c, T d) {
  return max(a, max(b, c, d));
}
const int MAXN = 1e5 * 5;
const int base = 1e9 + 7;
const int N = 5000;
int n;
long long suma, sumb;
priority_queue<int> ha, hb;
void process() {
  while (true) {
    if (ha.size()) {
      if (hb.size()) {
        if (ha.top() < hb.top()) {
          hb.pop();
        } else {
          suma += ha.top();
          ha.pop();
        }
      } else {
        suma += ha.top();
        ha.pop();
      }
    } else {
      if (hb.size())
        hb.pop();
      else
        return;
    }
    if (hb.size()) {
      if (ha.size()) {
        if (hb.top() < ha.top()) {
          ha.pop();
        } else {
          sumb += hb.top();
          hb.pop();
        }
      } else {
        sumb += hb.top();
        hb.pop();
      }
    } else {
      if (ha.size())
        ha.pop();
      else
        return;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = (1); i <= (n); ++i) {
    int x;
    cin >> x;
    ha.push(x);
  }
  for (int i = (1); i <= (n); ++i) {
    int x;
    cin >> x;
    hb.push(x);
  }
  process();
  cout << suma - sumb << '\n';
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
