#include <bits/stdc++.h>
using namespace std;
long long int A[100010], B[100010];
long long int N;
int main() {
  cin >> N;
  for (long long int i = 1; i <= N; i++) cin >> A[i];
  for (long long int i = 1; i <= N; i++) cin >> B[i];
  sort(A, A + N + 1);
  sort(B, B + N + 1);
  bool Aturn = true;
  long long int Asum = 0, Bsum = 0, Aidx = N, Bidx = N;
  for (long long int i = 0; i < N * 2; i++) {
    if (Aturn) {
      if (A[Aidx] >= B[Bidx])
        Asum += A[Aidx--];
      else
        Bidx--;
    } else {
      if (B[Bidx] >= A[Aidx])
        Bsum += B[Bidx--];
      else
        Aidx--;
    }
    Aturn = !Aturn;
  }
  cout << Asum - Bsum;
}
