#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pii pair<int,int>
#define Fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int MOD = 1000000007;
const int INF = 1e18;
const int N = 2e5;
class SegmentTree {
public:
    int n;
    vector<pair<int, int>> tree;
    vector<int> arr;

    SegmentTree(vector<int>& v) {
        n = v.size() - 1;
        arr = v;
        tree.assign(4 * n, { -INF, -1});
        build(1, 1, n);
    }

    void update(int ind, int val) { update(1, 1, n, ind, val); }

    pair<int, int> query(int l, int r) { return query(1, 1, n, l, r); }

private:
    pair<int, int> merge(pair<int, int> a, pair<int, int> b) {
        if (a.first > b.first) return a;
        if (b.first > a.first) return b;
        return (a.second < b.second ? a : b);
    }

    void build(int node, int start, int end) {
        if (start == end) {
            tree[node] = {arr[start], start};
        } else {
            int mid = (start + end) / 2;
            build(2 * node, start, mid);
            build(2 * node + 1, mid + 1, end);
            tree[node] = merge(tree[2 * node], tree[2 * node + 1]);
        }
    }

    void update(int node, int start, int end, int ind, int val) {
        if (ind < start || ind > end) return;
        if (start == end) {
            tree[node] = {max(tree[node].first,val), max(start, ind)};
        } else {
            int mid = (start + end) / 2;
            if (ind <= mid) update(2 * node, start, mid, ind, val);
            else update(2 * node + 1, mid + 1, end, ind, val);
            tree[node] = merge(tree[2 * node], tree[2 * node + 1]);
        }
    }

    pair<int, int> query(int node, int start, int end, int l, int r) {
        if (r < start || end < l) return { -INF, -1};
        if (l <= start && end <= r) return tree[node];
        int mid = (start + end) / 2;
        auto left = query(2 * node, start, mid, l, r);
        auto right = query(2 * node + 1, mid + 1, end, l, r);
        return merge(left, right);
    }
};

void solve(int tc) {
    int n; cin >> n;
    vector<int>a(n), b(n);
    for (int i = 0; i < n; i++)cin >> a[i];
    for (int i = 0; i < n; i++)cin >> b[i];
    vector<int>tmp(n + 1,-INF);
    SegmentTree seg(tmp);
    vector<int>dp(n), in(n);
    int mxx = 0;
    for (int i = 0; i < n; i++) {
        auto [mx , ind] = seg.query(1, a[i] - 1);
        if (mx != -INF) {
            dp[i] = mx + b[i];
            in[i] = ind;
        }
        else {
            dp[i] = b[i];
            in[i] = -1;
        }
        seg.update(a[i], dp[i]);
        mxx = max(mxx , dp[i]);
    }
    vector<int>lowest(n + 1, -1);
    int index = 0;
    for (int i = 0; i < n; i++) {
        if (in[i] == -1) {
            lowest[a[i]] = max(lowest[a[i]], i);
        }
        else {
            lowest[a[i]] = max(lowest[a[i]], lowest[in[i]]);
        }
        if (dp[i] == mxx)index = max(index, lowest[a[i]]);
    }
    cout << (n - index) << endl;
}
int32_t main() {
    Fast
    int t = 1;
    cin >> t;
    for (int tc = 1; tc <= t; tc++)
        solve(tc);
    return 0;
}