#include <bits/stdc++.h>
using namespace std;
mt19937 genrand(chrono::system_clock::now().time_since_epoch().count());
string inttostr(long long str) {
  stringstream stream;
  stream << str;
  return stream.str();
}
string numtobin(long long n) {
  string r = "";
  while (n) r = ((n & 1) ? '1' : '0') + r, n >>= 1;
  return r;
}
long long bintonum(string s) {
  long long n = 0, p = 1 << (s.length() - 1);
  for (char i : s) n += (i - '0') * p, p >>= 1;
  return n;
}
long long modexpo(long long a, long long b, long long n) {
  long long d = 1;
  while (b) {
    if (b & 1) d = (d * a) % n;
    b >>= 1;
    a = (a * a) % n;
  }
  return d;
}
long long expo(long long a, long long b) {
  long long d = 1;
  while (b) {
    if (b & 1) d = d * a;
    b >>= 1;
    a = a * a;
  }
  return d;
}
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long inv(long long a, long long m) { return modexpo(a, m - 2, m); }
void take_input_and_output_from_file() {}
inline long long scan_int() {
  long long NR = 0, sign = 1;
  char c = getchar();
  while (c < 48 || c > 57) {
    if (c == '-') sign = 0;
    c = getchar();
  }
  while (c > 47 && c < 58) {
    NR = (NR << 3) + (NR << 1) + (c - 48);
    c = getchar();
  }
  return (sign ? NR : (-NR));
}
int main() {
  long long n = scan_int(), i;
  vector<long long> a(n), b(n);
  for (i = 0; i < n; i++) a[i] = scan_int();
  for (i = 0; i < n; i++) b[i] = scan_int();
  sort((a).begin(), (a).end(), greater<long long>());
  sort((b).begin(), (b).end(), greater<long long>());
  long long j;
  i = 0;
  j = 0;
  long long sm1 = 0, sm2 = 0;
  long long k = 0;
  for (k = 0; k < 2 * n; k++) {
    if (i == n) {
      if (k & 1) sm2 += b[j];
      j++;
      continue;
    }
    if (j == n) {
      if (k % 2 == 0) sm1 += a[i];
      i++;
      continue;
    }
    if (k % 2 == 0) {
      if (a[i] > b[j]) {
        sm1 += a[i];
        i++;
      } else
        j++;
    } else {
      if (b[j] > a[i]) {
        sm2 += b[j];
        j++;
      } else
        i++;
    }
  }
  cout << sm1 - sm2 << endl;
  return 0;
}
