#include <iostream>
#include <algorithm>

using namespace std;

struct alapanyag{
    int l, m;
    int ido = 2;
    bool kesz = false;
};

bool kisebb(alapanyag A1, alapanyag A2){
    return A1.l < A2.l;
}

int main()
{
    int n;
    cin >> n;
    alapanyag A[n];
    for(int i=0; i<n; i++){
        cin >> A[i].l;
    }
    for(int i=0; i<n; i++){
        cin >> A[i].m;
    }
    sort(A, A+n, kisebb);

    cout << endl;
    for(int i=0; i<n; i++){
        cout << A[i].l << " ";
    }
    cout << endl;
    for(int i=0; i<n; i++){
        cout << A[i].m << " ";
    }
    cout << endl << endl;

    int t=0;

    int h=0, k=n-1;
    int c, xp = 0;
    while(h!=k){
        c = A[h].l;
        while(A[k].m - c < 0){
            c -= A[k].m;
            t += 2 * A[k].m;
            xp = A[k].m;
            k--;
        }
        A[k].m -= c;
        t += 2 * c;
        xp += c;
        while(xp >= A[h].l && h<=k){
            t += A[h].m;
            xp += A[h].m;
            h++;
        }
        h--;
    }
    cout << xp << endl;
    cout << t << endl;
}

/*
5
2 3 5 6 7
4 2 2 6 5
*/