#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>

using namespace std;

int main()//1(int n, vector<pair<int, int>> resources)
{
	iostream::sync_with_stdio(0);
	cin.tie(0);

	//int i;
	int n, i;
	cin >> n;

	vector<pair<int, int>> resources(n); // {xp treshold, needed amount}
	for (i = 0; i < n; i++)
	{
		cin >> resources[i].first;
	}
	for (i = 0; i < n; i++)
	{
		cin >> resources[i].second;
	}

	sort(resources.begin(), resources.end()); //sort by the xp tresholds

	int xp = 0, ans = 0, j = n-1;

	for (i = 0; i < n && i <= j; i++)
	{
		while (xp < resources[i].first && j > i) //while not enough xp for next easiest, do the hardest
		{
			int twice = min(resources[j].second, resources[i].first - xp); //get as much as (there is from the material/needed for the next xp treshold)
			resources[j].second -= twice; //document the changes

			xp += twice;
			ans += 2 * twice;

			if (resources[j].second == 0) j--; //get the hardest not completed material
		}

		int twice = min(resources[i].second, max(0, (resources[i].first - xp))); //get as much as (needed for the xp treshold/there is from the material)
		int once = resources[i].second - twice; //if there is a remainder, we get it twice as fast

		xp += once + twice;
		ans += once + 2 * twice;
	}

	//return(ans);
	cout << ans;
}