C.cpp

#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)

#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }

#define sqr(x) ((x) * (x))
#define ll long long
using namespace std;

const int MN = 100111;

int n, l[MN], d[MN], cntLeg[MN], cntCost[MN];
vector<int> ids[MN];

int main() {
    ios :: sync_with_stdio(false);
    while (cin >> n) {
        memset(cntLeg, 0, sizeof cntLeg);
        memset(cntCost, 0, sizeof cntCost);
        REP(i,MN) ids[i].clear();

        int total = 0;
        FOR(i,1,n) {
            cin >> l[i];
            cntLeg[l[i]]++;
            ids[l[i]].push_back(i);
        }
        FOR(i,1,n) {
            cin >> d[i];
            total += d[i];
        }

        int res = 0;
        FOR(i,1,100000) {
            int good = cntLeg[i]-1, cur = 0;
            for(int id : ids[i]) {
                cur += d[id];
            }

            FORD(x,200,1) {
                if (good <= 0) break;
                int can = min(good, cntCost[x]);
                good -= can;

                cur += can * x;
            }
            res = max(res, cur);

            for(int id : ids[i]) {
                cntCost[d[id]]++;
            }
        }
        cout << total - res << endl;
    }
}