99分求调

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e6 + 10;
struct node {
    int val, mexx;
} a[maxn];
bool cmp(node x, node y) {
    return x.val == y.val ? x.mexx > y.mexx : x.val > y.val;
}
int mp[maxn];
void solve() {
    int n;
    cin >> n;
    int mexxx = 0, mx = INT_MIN;
    mp[0] = 0;
    for(int i = 1; i <= n; i++) {
        cin >> a[i].val;
        if(a[i].val > mx) mx = a[i].val;
        mp[i] = 0;
    }
    for(int i = 1; i <= n; i++) {
        cin >> a[i].mexx;
        if(a[i].mexx <= n) mp[a[i].mexx]++;
        if(a[i].val == mx) {
            mexxx = max(mexxx, a[i].mexx);
        }
    }
    int num = 1;
    for(int mex = 0; mex <= n && num <= n; mex++) {
        for(; num <= n - mp[mex]; num++) {
            cout << mx - max(mex, (int)(mexxx == 0)) << "\n";
        }
    }
}
signed main() {
    int t;
    cin >> t;
    while(t--) {
        solve();
    }
}