#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(int a, int b) { return (a / gcd(a, b)) * b; }
string IntToString(long long int a) {
  char x[100];
  sprintf(x, "%lld", a);
  string s = x;
  return s;
}
vector<int> vec_in(int i, int j) {
  vector<int> v;
  for (int k = i; k < j; k++) {
    int n;
    cin >> n;
    v.push_back(n);
  }
  return v;
}
void cout_vec(vector<int> v, int i, int j) {
  for (int k = i; k < j; k++) {
    cout << v[k] << " ";
  }
}
bool is_prime(long long int n) {
  if (n == 1) {
    return false;
  }
  int i = 2;
  while (i * i <= n) {
    if (n % i == 0) {
      return false;
    }
    i += 1;
  }
  return true;
}
int common(vector<char> a, vector<char> b) {
  int count = 0;
  for (int i = 0; i < a.size(); i++) {
    for (int j = 0; j < b.size(); j++) {
      if (a[i] == b[j]) {
        count++;
        break;
      }
    }
  }
  return count;
}
long long int SieveOfEratosthenes(int n) {
  long long int count = 0;
  bool prime[n + 1];
  memset(prime, true, sizeof(prime));
  for (long long int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long int i = p * 2; i <= n; i += p) prime[i] = false;
    }
  }
  for (long long int p = 2; p <= n; p++) {
    if (prime[p]) {
      if (n % p == 0) count++;
    }
  }
  return count;
}
int cp(int n, int m, int i) {
  int count = 0;
  if (m == 1) {
    return 1000000007 - i;
  }
  while (n != 0) {
    n = n / m;
    count++;
  }
  return count;
}
void solve() {
  int n;
  cin >> n;
  vector<int> arr1;
  vector<int> arr2;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    arr1.push_back(t);
  }
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    arr2.push_back(t);
  }
  sort(arr1.begin(), arr1.end(), greater<int>());
  sort(arr2.begin(), arr2.end(), greater<int>());
  long long int count1 = 0;
  long long int count2 = 0;
  long long int i = 0;
  while (!arr1.empty() || !arr2.empty()) {
    if (i % 2 == 0) {
      if (!arr2.empty()) {
        if (!arr1.empty()) {
          if (arr1[0] >= arr2[0]) {
            count1 += arr1[0];
            arr1.erase(arr1.begin());
          } else {
            arr2.erase(arr2.begin());
          }
        } else {
          arr2.erase(arr2.begin());
        }
      } else {
        if (!arr1.empty()) {
          count1 += arr1[0];
          arr1.erase(arr1.begin());
        }
      }
    } else {
      if (!arr1.empty()) {
        if (!arr2.empty()) {
          if (arr2[0] >= arr1[0]) {
            count2 += arr2[0];
            arr2.erase(arr2.begin());
          } else {
            arr1.erase(arr1.begin());
          }
        } else {
          arr1.erase(arr1.begin());
        }
      } else {
        if (!arr2.empty()) {
          count2 += arr2[0];
          arr2.erase(arr2.begin());
        }
      }
    }
    i++;
  }
  cout << (count1 - count2) << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
