// UUID: ec0b97e3-5a0d-4920-95c3-af2554a38ac8
#include <bits/stdc++.h>
using namespace std;

int main() {
	long long N; cin>>N;
	vector<pair<long long, long long>> V(N);
	for(long long i=0; i<N; i++) cin>>V[i].first;
	for(long long i=0; i<N; i++) cin>>V[i].second;
	sort(V.begin(), V.end());
	vector<long long> prefix(N+1);
	prefix[1]=V[0].second;
	for(long long i=1; i<N; i++) prefix[i+1]=prefix[i]+V[i].second;
	long long ketpercesek=0;
	for(long long i=N-1; i>=0; i--)
	{
		if(V[i].first>ketpercesek+prefix[i])
		{
			if(ketpercesek+prefix[i]+V[i].second>V[i].first)
			{
				ketpercesek+=V[i].first-(ketpercesek+prefix[i]);
			}
			else
			{
				ketpercesek+=V[i].second;
			}
			
		}
	}
	cout<<ketpercesek+prefix[N];
}