#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;
vector<int> b;

int consistency(int n){

    map<int,int> mp;
    for(int i=0; i<n; i++){
        mp[a[i]] = b[i];
    }
    
    vector<int> p, q;
    for(auto& t : mp){
        p.push_back(t.first);
        q.push_back(t.second);
    }


    vector<int> sufixMaxi(n+1, -INF);
    for(int i=n-1; i>=0; i--){
        sufixMaxi[i] = max(sufixMaxi[i+1], q[i]);
    }

    int ct = 0;
    for(int i=0; i<n; i++){
        auto j = upper_bound(begin(p), end(p), a[i]) - begin(p);

        if(j!=n && b[i] < sufixMaxi[j]){
            ct++;
        }
    }

    return n-ct;

}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    b.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    for(int i=0; i<n; i++) cin >> b[i];
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}