#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  scanf("%d", &n);
  vector<int> a;
  vector<int> b;
  for (int i = 0; i < n; i++) {
    int val;
    scanf("%d", &val);
    a.push_back(val);
  }
  for (int i = 0; i < n; i++) {
    int val;
    scanf("%d", &val);
    b.push_back(val);
  }
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  reverse(a.begin(), a.end());
  reverse(b.begin(), b.end());
  a.push_back(0);
  b.push_back(0);
  a.push_back(0);
  b.push_back(0);
  long long suma = 0;
  long long sumb = 0;
  int i = 0;
  int j = 0;
  while (i <= n && j <= n) {
    if (a[i] > b[j]) {
      suma += a[i];
      i++;
    } else {
      j++;
    }
    if (b[j] > a[i]) {
      sumb += b[j];
      j++;
    } else {
      i++;
    }
  }
  long long ans = suma - sumb;
  printf("%lld\n", ans);
  return 0;
}
