#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace std;

typedef long long ll;

int main() {
    int n;
    cin >> n;
    n *= 2;
    vector<ll> a(n), b(n);
    rep(i, 0, n) cin >> a[i];
    rep(i, 0, n) cin >> b[i];
    vector<tuple<ll, ll, ll>> v;
    rep(i, 0, n) { v.push_back(make_tuple(a[i] + b[i], a[i], b[i])); }
    sort(v.begin(), v.end(), greater<tuple<ll, ll, ll>>());
    ll fi = 0, se = 0;
    rep(i, 0, n) {
        if (i % 2 == 0) {
            fi += get<2>(v[i]);
        } else {
            se += get<1>(v[i]);
        }
    }
    cout << se - fi << endl;
}