//地鼠游戏 (Codevs No.1052)

 //贪心

 #include<stdio.h>

 #include<algorithm>

 #include<queue>

 using namespace std;

 const int maxn=;

 struct node

 {

     int key;

     int time;

 };

 node F[maxn];

 bool comp(node a,node b)

 {

     return a.time>b.time;

 }

 priority_queue <int> q;

 int ans;

 int N;

 int main()

 {

     scanf("%d",&N);

     for(int i=;i<=N;i++)scanf("%d",&F[i].time);

     for(int i=;i<=N;i++)scanf("%d",&F[i].key);

     sort(F+,F+N+,comp);

     int now=F[].time;

     int loc=;

     while(now)

     {

         while(F[loc].time==now)

         {

             q.push(F[loc].key);

             loc++;

         }

         if(!q.empty())

         {

             ans+=q.top();

             q.pop();

         }

         now--;

     }

     printf("%d",ans);

     return ;

 }