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

const int N=2020;
int a[N],b[N];
LL dp[N][N];
LL INF;
LL rf(LL x){
    return x>=0?x:INF;
}
void work(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        cin>>b[i];
    }
    memset(dp,0xaf,sizeof(dp));
    dp[0][0]=0;
    for(int i=1;i<=n;i++){
        for(int j=0;j<=i;j++){
            dp[i][j]=rf(max(
                j==0?INF:dp[i-1][j-1]+b[i]-a[i],
                dp[i-1][j]+b[i]
            ));
        }
    }
    for(int i=n;i>=0;i--){
        if(dp[n][i]>=0){
            cout<<i<<endl;
            return;
        }
    }
}

int main(){
    memset(&INF,0xaf,sizeof(INF));
    ios::sync_with_stdio(false);
    int t;
    cin>>t;
    while(t--){
        work();
    }
    return 0;
}