#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint unsigned
#define pii pair<int,int>
#define pll pair<ll,ll>
#define IT iterator
#define PB push_back
#define fi first
#define se second
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define CLR(a,v) memset(a,v,sizeof(a));
#define CPY(a,b) memcpy(a,b,sizeof(a));
#define debug puts("wzpakking")
#define y1 ysghysgsygsh 
using namespace std;
const int N=2005;
int n,a[N],b[N];
ll f[N][N];
void solve(){
    scanf("%d",&n);
    For(i,1,n) scanf("%d",&a[i]);
    For(i,1,n) scanf("%d",&b[i]);
    memset(f,233,sizeof(f));
    f[0][0]=0;
    For(i,1,n) For(j,0,i-1){
        if (f[i-1][j]<0) continue;
        //cout<<f[i-1][j]<<' '<<i<<' '<j<<endl;
        f[i][j]=max(f[i][j],f[i-1][j]+b[i]);
        if (f[i-1][j]+b[i]>=a[i]) f[i][j+1]=max(f[i][j+1],f[i-1][j]+b[i]-a[i]);
    }
    int ans=0;
    For(i,1,n) if (f[n][i]>=0) ans=i;
    cout<<ans<<endl;
}
int main(){
    int T;
    scanf("%d",&T);
    while (T--) solve();
}