#include <bits/stdc++.h>
#define ls (rt<<1)
#define rs (rt<<1|1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=4e5+10;
const int INF=0x3f3f3f3f;
int a[N],n;
pii pa[N];
int mx[N<<2],lazy[N<<2];
int main() {
    auto push_down=[&](int rt){
        if(lazy[rt]){
            lazy[ls]+=lazy[rt];
            lazy[rs]+=lazy[rt];
            mx[ls]-=lazy[rt];
            mx[rs]-=lazy[rt];
            lazy[rt]=0;
        }
    };
    function<void(int,int,int)>build=[&](int l,int r,int rt){
        if(l==r){mx[rt]=l;return ;}
        int mid=l+r>>1;
        build(l,mid,ls);
        build(mid+1,r,rs);
    };
    function<int(int,int,int,int)>query=[&](int l,int r,int x,int rt){
        if(l==r)return mx[rt];
        push_down(rt);int mid=l+r>>1;
        if(x<=mid)return query(l,mid,x,ls);else return query(mid+1,r,x,rs);
    };
    function<void(int,int,int,int,int,int)>update=[&](int l,int r,int L,int R,int val,int rt){
        if(L<=l&&r<=R){mx[rt]-=val;lazy[rt]+=val;return ;}
        push_down(rt);int mid=l+r>>1;
        if(L<=mid)update(l,mid,L,R,val,ls);
        if(mid<R)update(mid+1,r,L,R,val,rs);
        mx[rt]=max(mx[ls],mx[rs]);
    };
    scanf("%d",&n);
    for(int i=1;i<=2*n;i++)scanf("%d",&a[i]),pa[i]=make_pair(a[i],i>n?i-n:n-i+1);
    sort(pa+1,pa+2*n+1);
    reverse(pa+1,pa+2*n+1);
    ll ans=0;
    build(1,n,1);
    for(int i=1;i<=2*n;i++){
        int x=pa[i].second;
        int val=query(1,n,x,1);
        if(val==0)continue;
        ans+=pa[i].first;
        int l=1,r=n,res=-1;
        while (l<=r){
            int mid=l+r>>1;
            if(query(1,n,mid,1)>=val){
                res=mid;
                r=mid-1;
            }else l=mid+1;
        }
        update(1,n,res,n,1,1);
    }
    cout<<ans;
    return 0;
}
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORN(i, n) for (int i = 1; i <= n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> void re(V<T>& x) { 
    trav(a, x)
        cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;
    vi a(2 * n);
    cin >> a;
    multiset <int> ms;
    int ans = 0;
    trav (e, a)
    	ans += e;
    FOR (i, n) {
    	int l = n - 1 - i;
    	int r = n + i;
    	ms.insert(a[l]);
    	ms.insert(a[r]);
    	ans -= *ms.begin();
    	ms.erase(ms.begin());
    }
    cout << ans << endl;
}