#include <bits/stdc++.h>

using namespace std;

int main()
{
    cin.tie(0);
    iostream::sync_with_stdio(0);
    int n; cin >> n;
    map<int,long> req;
    set<int> order;
    vector<int> l(n);
    for(int i = 0;i < n; i++)
    {
        cin >> l[i];
        order.insert(l[i]);
    }
    int x;
    for(int i = 0;i < n; i++)
    {
        cin >> x;
        if(req[l[i]] == NULL)
        {
            req[l[i]] = x;
        }
        else
        {
            req[l[i]]+=x;
        }
    }
    long time = 0;
    long exp = 0;
    for(int y : order)
    {
        if(y>exp+req[y])
        {
            exp+=req[y];
            time+=2*req[y];
        }
        else if(y <= exp)
        {
            exp+=req[y];
            time+=req[y];
        }
        else
        {
            time+=2*(y-exp-1)+req[y]-y+exp+1; //(y-exp) -> difference required to get faster (req[y]-y+exp) -> requirements after remving used
            exp+=req[y];
        }
        //cout << time << "-" << exp <<endl;
    }
    cout << time;
}