#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
    void add(X &x, const Y &y) {
        x = (x + y);
        if(x >= MOD) x -= MOD;
    }

template<class X, class Y>
    void sub(X &x, const Y &y) {
        x = (x - y);
        if(x < 0) x += MOD;
    }

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 5000 + 10;

int dp[N][N];
pii trace[N][N];
bool used[N];

struct D {
    int fi, se, id;
} a[N];

void BaoJiaoPisu() {
    int n; cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i].se;
    for(int i = 1; i <= n; i++) {
        cin >> a[i].fi;
        a[i].id = i;
    }

    sort(a + 1, a + 1 + n, [&](D x, D y) {
        if(x.se == y.se) return x.fi < y.fi;
        return x.se > y.se;
    });

    for(int i = 0; i <= n; i++) {
        for(int j = 0; j <= n + 2; j++) dp[i][j] = -INF;
    }

    dp[0][0] = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j <= n; j++) {
            if(j > 0) {
                trace[i][j] = trace[i - 1][j - 1];
                dp[i][j] = dp[i - 1][j - 1];
            }
            if(maximize(dp[i][j], dp[i - 1][j + 1] + a[i].fi)) trace[i][j] = mp(i, j);
        }
    }

    cout << dp[n][0] << '\n';
    vector<pii> ans;
    int pos = n, coef = 0;
    while(pos) {
        int curr = trace[pos][coef].fi;
        if(curr == pos) {
            used[pos] = true;
            ans.pb(mp(a[pos].id, 0));
            pos--;
            coef++;
        } else {
            pii x = trace[pos][coef];
            pos = x.fi;
            coef = x.se;
        }
    }

    reverse(all(ans));
    int iter = 0;
    for(int i = 1; i <= n; i++) {
        if(!used[i]) {
            ans[iter++].se = a[i].id;
        }
    }

    for(auto x : ans) {
        cout << x.fi << " " << x.se << '\n';
    }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #else
    //online
    #endif

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        BaoJiaoPisu();
    }
}