//Δ_1007
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 2222;
int n,a[N],b[N];
LL f[N][N];
void cmax(LL&x,LL y){
    if(x<y)
        x=y;
}
int main()
{
    int T,i,j;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(i=1;i<=n;i=i+1)
            scanf("%d",a+i);
        for(i=1;i<=n;i=i+1)
            scanf("%d",b+i);
        for(i=0;i<=n;i=i+1)
            for(j=0;j<=n;j=j+1)
                f[i][j]=-1;
        f[0][0]=0;
        for(i=0;i<n;i=i+1){
            for(j=0;j<=i;j=j+1){
                if(f[i][j]<0)
                    continue;
                cmax(f[i+1][j],f[i][j]+b[i+1]);
                cmax(f[i+1][j+1],f[i][j]+b[i+1]-a[i+1]);
            }
        }
        for(i=0;i<=n;i=i+1)
            if(f[n][i]>=0)
                j=i;
        printf("%d\n",j);
    }
    return 0;
}