/*
*  *  *  *  *  *  *  *  *  *  *  *  *  *  *  *  *  *
* 
* @author: Xingjian Bai 
* @date: 2021-04-10 13:21:51
* @description: 
*  
* 
* @notes: 
* g++ -fsanitize=address -ftrapv 
*  *  *  *  *  *  *  *  *  *  *  *  *  *  *  *  *  */
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define TIME (double)clock()/CLOCKS_PER_SEC
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
const int mod = 1000000007; 
const ll oo = 1e18;
const ld eps = 1e-8;
#define debug(x) cerr << "(debug mod) " << #x << " = " << x << endl

int n;
ll v[1000010], s[1000010];
priority_queue <ll> q;

int main() {
    ios::sync_with_stdio(false);
    cin >> n;
    for (int i = 1; i <= 2 * n; i ++) {
    	cin >> v[i];
    	s[i] = s[i - 1] + v[i];
    }
    // ll mn = 1e16;
    // for (int i = n; i <= 2 * n; i ++)
    	// mn = min (mn, s[i] - s[i - n]);
    // cerr << mn << " " << s[2 * n] << endl;
    // cout << s[2 * n] - mn << endl;
    
    ll mn = 0;
    for (int i = n; i >= 1; i --) {
    	q.push(-v[i]);
    	q.push(-v[n + n - i + 1]);
    	mn += q.top();
    	q.pop();
    }
    cout << s[2 * n] + mn << endl;
    return 0;
}
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int main(){
    StarBurstStream

    int n;
    cin >> n;

    vector<ll> v(2 * n + 1);
    ll sum = 0;
    for(int i = 1; i <= 2 * n; i++){
        cin >> v[i];
        sum += v[i];
    }

    std::priority_queue<ll, vector<ll>, greater<>> pq;
    ll ans = 0;
    for(int i = 1; i <= n; i++){
        pq.push(v[n - i + 1]);
        pq.push(v[n + i]);
        ans += pq.top();
        pq.pop();
    }
    ans = sum - ans;
    cout << ans << "\n";

    return 0;
}