#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef long long ll;

int main() {
	ll n;
	cin >> n;
	vector<pair<ll, ll>> data(n);
	ll t = 0, e = 0;
	for (int i = 0; i < n; i++) cin >> data[i].first;
	for (int i = 0; i < n; i++) {
		cin >> data[i].second;
		e += data[i].second;
		t += data[i].second * 2;
	}
	sort(data.rbegin(), data.rend());
	for (int i = 0; i < n; i++) {
		ll change = max((ll)0, min(e - data[i].first, data[i].second));
		e -= change;
		t -= change;
	}
	cout << t;
	return 0;
}