//全WA代码
#include<bits/stdc++.h>

using namespace std;

int n,ans,minn=1e8,k=1;
struct pos{
    int t,m;
}a[1010];

bool cmp(pos x,pos y){
    if(x.t!=y.t) return x.t<y.t;
    else return x.m>y.m;
}

int main(){
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i].t;
    for(int i=1;i<=n;i++) cin>>a[i].m;
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=n;i++){
        if(a[i].t!=a[i-1].t){
            ans+=a[i].m;
        }
        else {
            ans=max(ans,ans-minn+a[i].m);
        }
        minn=min(minn,a[i].m);
    }
    cout<<ans;
    return 0;
}