#include <bits/stdc++.h>
using namespace std;
long long inf = 1e9;
long long mod = 1000000007;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
char dc[] = {'u', 'l', 'd', 'r'};
int a[30];
int main() {
  int n, x;
  cin >> n;
  priority_queue<int> q1, q2;
  for (int i = 0; i < n; i++) {
    cin >> x;
    q1.push(x);
  }
  for (int i = 0; i < n; i++) {
    cin >> x;
    q2.push(x);
  }
  long long a = 0, b = 0, first = 1;
  while (!q1.empty() || !q2.empty()) {
    if (first) {
      if ((!q1.empty() && q1.top() >= q2.top()) || q2.empty()) {
        a += q1.top();
        q1.pop();
      } else
        q2.pop();
    } else {
      if ((!q2.empty() && q2.top() >= q1.top()) || q1.empty()) {
        b += q2.top();
        q2.pop();
      } else
        q1.pop();
    }
    first = !first;
  }
  cout << a - b << '\n';
}
