/* -*- coding: utf-8 -*-
 *
 * 2856.cc:  No.2856 Junk Market Game - yukicoder
 */

#include<cstdio>
#include<algorithm>
#include<utility>

using namespace std;

/* constant */

const int MAX_N = 1000;
const int MAX_N2 = MAX_N * 2;

/* typedef */

using ll = long long;
using pii = pair<int,int>;

/* global variables */

int as[MAX_N2], bs[MAX_N2];
pii ps[MAX_N2];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  int n2 = n * 2;
  for (int i = 0; i < n2; i++) scanf("%d", as + i);
  for (int i = 0; i < n2; i++) scanf("%d", bs + i);
  
  for (int i = 0; i < n2; i++) ps[i] = {as[i] + bs[i], as[i]};
  sort(ps, ps + n2);
  
  ll x = 0, y = 0;
  for (int i = 0; i < n2; i++) {
    if (! (i & 1))
      x += ps[i].second;
    else
      y += ps[i].first - ps[i].second;
  }
  
  printf("%lld\n", x - y);
  
  return 0;
}