#include <bits/stdc++.h>
using namespace std;
long long N, in, SA, SB;
vector<long long> A, B;
void solution1() {
  sort(A.begin(), A.end());
  sort(B.begin(), B.end());
  int turn = 1;
  while (A.size() || B.size()) {
    if (A.size() && B.size()) {
      if (A.back() > B.back()) {
        if (turn == 1) SA += A.back();
        A.pop_back();
      } else {
        if (turn == 0) SB += B.back();
        B.pop_back();
      }
    } else if (A.size()) {
      if (turn == 1) SA += A.back();
      A.pop_back();
    } else if (B.size()) {
      if (turn == 0) SB += B.back();
      B.pop_back();
    }
    turn = (turn + 1) % 2;
  }
  cout << SA - SB << endl;
}
int main() {
  cin >> N;
  for (int i = 0; i < N; i++) cin >> in, A.push_back(in);
  for (int i = 0; i < N; i++) cin >> in, B.push_back(in);
  solution1();
  return 0;
}
