//枚举高度[1,100000]，>l的全部割掉，<l的砍掉最小的

#include<bits/stdc++.h>

using namespace std;

#define N 100005

#define ll long long

struct Node{ll id,l,d;}a[N],b[N];

int cmp(Node a,Node b){

    return a.l<b.l;

}

ll n,cnt[];

ll sum[N];

ll query(ll k){

    if(k<)return ;

    ll res=;

    for(int i=;i<=;i++){

        if(k>cnt[i]){

            res+=cnt[i]*i;

            k-=cnt[i];

        }else if(k<=cnt[i]){

            res+=k*i;

            break;

        }

    }

    return res;

}

int main(){

    cin>>n;

    for(int i=;i<=n;i++)cin>>a[i].l;

    for(int i=;i<=n;i++)

        cin>>a[i].d,a[i].id=i;

    for(int i=;i<=n;i++)b[i]=a[i];

    sort(b+,b++n,cmp);

    for(int i=;i<=n;i++)sum[i]=sum[i-]+b[i].d;

    ll ans=0x3f3f3f3f3f3f3f3f;

    for(int l=,r;l<=n;l=r+){

        r=l;

        while(b[r+].l==b[l].l)r++;

        ll tmp=sum[n]-sum[r],len=r-l+;

        tmp+=query(r-(len*-));

        ans=min(ans,tmp);

        for(int i=l;i<=r;i++)

            cnt[b[i].d]++;

    }

    cout<<ans<<endl;

}