#include <iostream>
#include <vector>
#include <algorithm>

std::vector<std::pair<int, int>> beolvas(std::istream &in) {
    size_t n;
    in >> n;

    std::vector<std::pair<int, int>> v(n);

    for (auto i = 0u; i < n; i++) {
        in >> v[i].first;
    }

    for (auto i = 0u; i < n; i++) {
        in >> v[i].second;
    }

    return v;
}

void feldolgoz(std::vector<std::pair<int, int>> v) {
    std::sort(v.begin(), v.end(), [](const auto &a, const auto &b) {
        return a.first < b.first;
    });

    size_t i = 0;
    size_t j = v.size() - 1;
    size_t ido = 0;
    int tp = 0;
    while (i <= j) {
        if (tp < v[i].first) {
            const auto hianyzo_tp = v[i].first - tp;

            if (v[j].second <= hianyzo_tp) {
                ido += v[j].second * 2;
                tp += v[j].second;
                j--;

            } else {
                v[j].second -= hianyzo_tp;
                ido += hianyzo_tp * 2;
                tp += hianyzo_tp;
            }

        } else {
            ido += v[i].second;
            tp += v[i].second;
            i++;
        }
    }

    std::cout << ido << std::endl;
}

int main() {
    auto v = beolvas(std::cin);
    feldolgoz(std::move(v));

    return 0;
}