#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    vector<ll> A(N), B(N);
    rep(i, N) { cin >> A[i]; }

    rep(i, N) { cin >> B[i]; }

    sort(all(A));
    int sum = 0;

    multiset<ll> mul;
    mul.insert(-INF);
    mul.insert(INF);
    rep(i, N) {
        mul.insert(B[i]);
        int j = *mul.lower_bound(A[i]);
        sum += j;
    }

    cout << sum << endl;
    return 0;
}