#include <bits/stdc++.h>
using lol = long long int;
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n = 0;
  cin >> n;
  deque<int> a;
  deque<int> b;
  for (int i = 0; i < n; i++) {
    int va = 0;
    cin >> va;
    a.push_back(va);
  }
  for (int i = 0; i < n; i++) {
    int vb = 0;
    cin >> vb;
    b.push_back(vb);
  }
  sort(a.rbegin(), a.rend());
  sort(b.rbegin(), b.rend());
  lol as = 0, bs = 0;
  bool st = 0;
  while (a.size() != 0 || b.size() != 0) {
    if (st == 0) {
      if (b.size() == 0) {
        as += *a.begin();
        a.pop_front();
      } else if (a.size() == 0) {
        b.pop_front();
      }
      if (a.size() != 0 && b.size() != 0) {
        if (*a.begin() > *b.begin()) {
          as += *a.begin();
          a.pop_front();
        } else {
          b.pop_front();
        }
      }
      st = 1;
    } else {
      if (a.size() == 0) {
        bs += *b.begin();
        b.pop_front();
      } else if (b.size() == 0) {
        a.pop_front();
      }
      if (a.size() != 0 && b.size() != 0) {
        if (*b.begin() > *a.begin()) {
          bs += *b.begin();
          b.pop_front();
        } else {
          a.pop_front();
        }
      }
      st = 0;
    }
  }
  cout << as - bs;
  return 0;
}
