/*
 *   Copyright (c) 2025 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll calc(int ind,int n,int last,vector<int>&a,vector<int>&b)
{
    if(ind == n) return 0;
    if(a[ind] > last) 
    {
        return max(calc(ind+1,n,a[ind],a,b) + b[ind] , calc(ind+1,n,last,a,b));
    }else return calc(ind+1,n,last,a,b);
}

int main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int t; cin >> t; while(t--)
    {
        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];
        
        ll mxans = calc(0,n,0,a,b);
        int ans = n;
        for(int i=1;i<n;i++)
        {
            if(calc(i,n,0,a,b) < mxans) break;
            --ans;
        }
        cout<<ans<<'\n';
    }
}