#include <bits/stdc++.h>
using namespace std;

bool comp(pair<int, int> a, pair<int, int> b) {
    return a.first < b.first;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

	int n;
    pair<int, int> materials[100001];

    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> materials[i].first;
    }
    for (int i = 0; i < n; i++) {
        cin >> materials[i].second;
    }
    
    sort(materials, materials+n, comp);

    int i = 0;
    int j = n - 1;
    int xp = 0;
    int time = 0;

    while (i < j || materials[i].second) {
        if (xp >= materials[i].first) {
            time++;
            if (--(materials[i].second) == 0) {
                i++;
            }
        }
        else {
            time += 2;
            if (--(materials[j].second) == 0) {
                j--;
            }
        }
        xp++;
    }

    cout << time;

}