#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll N = 2e5+7;
ll node[N];

ll query(ll index) {
    ll ans = 0;
    while(index > 0) {
        ans = max(ans, node[index]);
        index -= index & (-index);
    }
    return ans;
}

void update(ll index, ll value, ll n) {
    while(index <= n) {
        node[index] = max(node[index], value);
        index += index & (-index);
    }
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int tc; cin >> tc;

    while(tc--) {
        ll n; cin >> n;
        for (ll i = 0; i <= n; i++) node[i] = 0;

        vector<ll> a(n), b(n);
        for (auto &u : a) cin >> u;
        for (auto &u : b) cin >> u;

        vector<ll> temp(a.begin(), a.end());
        sort(temp.begin(), temp.end());
        temp.erase(unique(temp.begin(), temp.end()), temp.end());
        for (ll i = 0; i < n; i++) a[i] = lower_bound(temp.begin(), temp.end(), a[i]) - temp.begin() + 1;

        ll m = temp.size();
        vector<ll> dp(n);
        ll mxAns = 0;
        for (ll i = 0; i < n; i++) { 
            ll best = query(a[i]-1) + b[i];
            dp[i] = best;
            update(a[i], best, m);
            mxAns = max(mxAns, best);
        }

        ll current = mxAns, indx = n;
        for (ll i = n-1; i >= 0; i--) {
            if (dp[i] == current) {
                indx = i;
                current -= b[i];
            }
        }

        cout << n - indx << "\n";
    }
}