#include<iostream>
#include<cstring>
#include<vector>
#include<numeric>
#include<queue>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    vector<pair<int, int> > p(n);
    for(int i = 0; i < n; i++){
        cin >> p[i].first;
    }
    for(int i = 0; i < n; i++){
        int x;
        cin >> x;
        p[i].second = -x;
    }
    sort(p.begin(), p.end(), greater<>());
    LL ans = 0;
    priority_queue<int, vector<int>, greater<int> > q;
    for(int i = 0; i < n; i++){
        auto [x, y] = p[i];
        y = -y;
        if (i % 2 == 1){
            ans += y;
            q.push(y);
        }
        else{
            if (!q.empty() and y > q.top()){
                ans += y - q.top();
                q.pop();
                q.push(y);
            }
        }
    }
    cout << ans << '\n';

}