#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> PII;
#define x first
#define y second
const int N=510;
PII q[N]; 
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++) cin>>q[i].x;
	for(int i=1;i<=n;i++) cin>>q[i].y;
	sort(q+1,q+n+1);
	priority_queue<int,vector<int>,greater<int>> heap;
	for(int i=1;i<=n;i++)
	{
		heap.push(q[i].y);
		if(heap.size()>q[i].x)
		{
			heap.pop();
		}
	}
	int s=0;
	while(heap.size())
	{
		s+=heap.top();
		heap.pop();
	}
	cout<<s;
	return 0;
}