#include <bits/stdc++.h>

using namespace std;
vector<pair<long long,long long>> v;
vector<pair<long long,long long>> v2;
vector<bool> ok;
int main()
{
    int n;
    cin >> n;
    long long t1,t2;
    for (int i = 0; i < n; i++){
        cin >> t1;
        v.push_back(make_pair(t1,0));
    }
    for (int i = 0; i < n; i++){
        cin >> t2;
        v[i].second = t2;
    }
    sort(v.begin(),v.end());
    long long sum = 0;
    long long tempSum = 0;
    long long prev;
    bool da;
    int i = 0;
    while (i < n) {
        da = false;
        tempSum += v[i].second;
        prev = v[i].first;
        while (i < n && prev == v[i+1].first) {
            da = true;
            tempSum += v[i+1].second;
            i++;
        }
        if (da)
            sum = tempSum;
        i++;
    }
    cout << sum;
    return 0;
}