#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

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>> C(2 * N);
    for (int i = 0; i < 2 * N; i++) C[i] = {A[i] + B[i], i};
    ranges::sort(C);

    ll ans = 0;
    for (int i = 0; i < 2 * N; i += 2) {
        ans += A[C[i].second];
        ans -= B[C[i + 1].second];
    }

    cout << ans << endl;
}