#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, i, j, as = 0, bs = 0;
  cin >> n;
  priority_queue<long long int> a;
  priority_queue<long long int> b;
  for (i = 0; i < n; i++) {
    cin >> j;
    a.push(j);
  }
  for (i = 0; i < n; i++) {
    cin >> j;
    b.push(j);
  }
  int f = 0;
  while (a.size() > 0 && b.size() > 0) {
    if (f == 0) {
      if (a.top() > b.top()) {
        as += a.top();
        a.pop();
      } else {
        b.pop();
      }
      f = 1;
    } else {
      if (a.top() < b.top()) {
        bs += b.top();
        b.pop();
      } else {
        a.pop();
      }
      f = 0;
    }
  }
  while (!a.empty()) {
    if (f == 0) {
      as += a.top();
      a.pop();
      f = 1;
    } else {
      a.pop();
      f = 0;
    }
  }
  while (!b.empty()) {
    if (f == 1) {
      bs += b.top();
      b.pop();
      f = 0;
    } else {
      b.pop();
      f = 1;
    }
  }
  cout << as - bs << endl;
  return 0;
}
