#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define x first
#define y second
typedef pair<int,int> pii;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x,T y){x<y?x=y:T();}
template <typename T> void chkmin(T &x,T y){x>y?x=y:T();}
template <typename T> void readint(T &x)
{
    x=0;int f=1;char c;
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-1;
    for(;isdigit(c);c=getchar())x=x*10+c-'0';
    x*=f;
}
/*const int MOD=;
inline int dmy(int x){return x>=MOD?x-MOD:x;}
inline void inc(int &x,int y){x=dmy(x+y);}
int qmi(int x,int y)
{
    int ans=1;
    for(;y;y>>=1,x=1ll*x*x%MOD)
        if(y&1)ans=1ll*ans*x%MOD;
    return ans;
}*/ 
const int MAXN=2005;

int n;
ll a[MAXN],b[MAXN],f[MAXN][MAXN];

void solve()
{
    readint(n);
    for(int i=1;i<=n;++i)readint(a[i]);
    for(int i=1;i<=n;++i)readint(b[i]),b[i]+=b[i-1];
    for(int i=0;i<=n;++i)
    {
        f[i][0]=0;
        for(int j=1;j<=i;++j)
        {
            f[i][j]=(j==i?1ll<<60:f[i-1][j]);
            if(f[i-1][j-1]+a[i]<=b[i])chkmin(f[i][j],f[i-1][j-1]+a[i]);
        }
    }
    int ans=0;
    for(int j=n;j;--j)
        if(f[n][j]<=b[n]){ans=j;break;}
    printf("%d\n",ans);
}

int main()
{
    #ifdef LOCAL
    freopen("code.in","r",stdin);
//    freopen("code.out","w",stdout);
    #endif
    int T;
    readint(T);
    while(T--)solve();
    return 0;
}