#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

int main()
{
  int n;
  cin >> n;
  vector<int> a(2 * n), b(2 * n);
  for (int i = 0; i < 2 * n; ++i) cin >> a[i];
  for (int i = 0; i < 2 * n; ++i) cin >> b[i];
  vector<pair<int, int>> vp(2 * n);
  for (int i = 0; i < 2 * n; ++i) vp[i] = {a[i] + b[i], i};
  sort(vp.rbegin(), vp.rend());
  long long ans = 0;
  for (int i = 0; i < 2 * n; ++i)
  {
    ans += a[i];
    if (i % 2 == 0) ans -= vp[i].first;
  }
  cout << ans << endl;
}