#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> PP;
// #define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ORREP(i,n) for(ll i=(n);i>=1;--i)
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
#define debug true
#define debug2 false


int main(void){
    //cin.tie(nullptr);
    //ios::sync_with_stdio(false);
    
    ll N;
    cin >> N;
    N *= 2;
    vector<array<ll,3>> AB(N);
    vector<ll> A(N),B(N);
    REP(i,N){cin >> A[i];}
    REP(i,N){cin >> B[i];}
    REP(i,N){
        ll a = A[i], b = B[i];
        AB[i] = {a+b,a,b};
    }
    sort(ALL(AB));
    
    ll Ans = 0;
    REP(i,N){
        // cout << AB[i][1] MM AB[i][2] << endl;
        if(i%2==1){
            Ans -= AB[i][2];
        }else{
            Ans += AB[i][1];
        }
    }
    
    cout << Ans << endl;
    
    return 0;
    
}