#include <bits/stdc++.h>
using namespace std;
void print(long long int a[], long long int n) {
  for (long long int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << "\n";
}
long long int power(long long int x) {
  long long int u = 0;
  while (x % 2 == 0) {
    u++;
    x = x / 2;
  }
  return u;
}
long long int powM(long long int x, long long int y, long long int m) {
  long long int ans = 1, r = 1;
  x %= m;
  while (r > 0 && r <= y) {
    if (r & y) {
      ans *= x;
      ans %= m;
    }
    r <<= 1;
    x *= x;
    x %= m;
  }
  return ans;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool isPrime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int main() {
  int t1 = 1;
  long long int M = 1e9 + 7;
  while (t1--) {
    long long int n, o;
    cin >> n;
    vector<long long int> a;
    vector<long long int> b;
    for (long long int i = 0; i < n; i++) {
      cin >> o;
      a.push_back(o);
    }
    for (long long int i = 0; i < n; i++) {
      cin >> o;
      b.push_back(o);
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    long long int a1 = 0;
    long long int b1 = 0;
    long long int l = 1;
    while (a.size() != 0 && b.size() != 0) {
      if (b[b.size() - 1] > a[a.size() - 1]) {
        b.pop_back();
      } else {
        a1 += a[a.size() - 1];
        a.pop_back();
      }
      if (a.size() == 0 || b.size() == 0) {
        l = 0;
        break;
      }
      if (b[b.size() - 1] < a[a.size() - 1]) {
        a.pop_back();
      } else {
        b1 += b[b.size() - 1];
        b.pop_back();
      }
    }
    if (l) {
      if (a.size() == 0) {
        if (b.size() >= 2) {
          for (long long int j = b.size() - 2; j >= 0; j = j - 2) {
            b1 += b[j];
          }
        }
      }
      if (b.size() == 0) {
        if (a.size() >= 1) {
          for (long long int j = a.size() - 1; j >= 0; j = j - 2) {
            a1 += a[j];
          }
        }
      }
    } else {
      if (a.size() == 0) {
        if (b.size() >= 1) {
          for (long long int j = b.size() - 1; j >= 0; j = j - 2) {
            b1 += b[j];
          }
        }
      }
      if (b.size() == 0) {
        if (a.size() >= 2) {
          for (long long int j = (a.size()) - 2; j >= 0; j = j - 2) {
            a1 += a[j];
          }
        }
      }
    }
    cout << a1 - b1;
  }
  return 0;
}
