#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn = 1000005;

int segment_tree[3 * maxn];

int merge_nodes(int A, int B) {
    return A + B;
}
void build_tree(int L, int R, int node) {
    if(L == R) {
        segment_tree[node] = 1;
        return;
    }

    int middle = (L + R) / 2;
    build_tree(L, middle, 2 * node);
    build_tree(middle + 1, R, 2 * node + 1);
    segment_tree[node] = merge_nodes(segment_tree[2 * node], segment_tree[2 * node + 1]);
}

int query(int x, int L, int R, int node) {
    if(L == R) {
        return L;
    }

    int middle = (L + R) / 2;
    if(segment_tree[2 * node] >= x) {
        return query(x, L, middle, 2 * node);
    }
    else {
        return query(x - segment_tree[2 * node], middle + 1, R, 2 * node + 1);
    }

}
void update(int idx, int L, int R, int node) {
    if(L == R) {
        segment_tree[node] = 0;
        return;
    }
    int middle = (L + R) / 2;

    if(idx <= middle) {
        update(idx, L, middle, 2 * node);
    }
    else {
        update(idx, middle + 1, R, 2 * node + 1);
    }

    segment_tree[node] = merge_nodes(segment_tree[2 * node], segment_tree[2 * node + 1]);

}
int main() {
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n;

    vector<int> v(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }

    sort(v.begin(), v.end());
    build_tree(0, n - 1, 1);
    vector<int> q(n);
    for(int i = 0; i < n; i++) {
        cin >> q[i];
        q[i]++;
    }

    vector<int> res(n);
    for(int i= n - 1; i >= 0;i --) {
        int idx = query(q[i], 0, n - 1, 1);
        res[i] = v[idx];

        update(idx, 0, n - 1, 1);
    }

    for(int i = 0; i < n; i++) {
        cout << res[i] << " ";
    }
    return 0;
}