#include<bits/stdc++.h>
#define N 2005
#define LL long long
#define Ms(a,b) memset(a,b,sizeof a)
#define db(x) cerr<<#x<<"="<<x<<endl;
#define db2(x,y) cerr<<#x<<"="<<x<<" "<<#y<<"="<<y<<endl;
#define db3(x,y,z) cerr<<#x<<"="<<x<<" "<<#y<<"="<<y<<" "<<#z<<"="<<z<<endl;
using namespace std;
int T,n,a[N],b[N];
LL dp[N][N];
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(int i=1;i<=n;i++)scanf("%d",&a[i]);
        for(int i=1;i<=n;i++)scanf("%d",&b[i]);
        Ms(dp,-1),dp[0][0]=0;
        for(int i=0;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(~dp[i][j-1])dp[i][j]=dp[i][j-1]+b[j];
                if(i&&~dp[i-1][j-1])dp[i][j]=max(dp[i][j],dp[i-1][j-1]+b[j]-a[j]);
            }
        }
        int res=0;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)if(dp[i][j]>=0)res=i;
        printf("%d\n",res);
    }
    return 0;
}