#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;

template<class T> void read(T &x){
    int f=0; x=0; char ch=getchar();
    for(;!isdigit(ch);ch=getchar()) f|=(ch=='-');
    for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
    if(f) x=-x;
}

const int N=2005;
const ll inf=1e18;
ll f[N][N],a[N],b[N],sa[N],sb[N];
int n;

void cmin(ll &x,ll y){
    if(y<x) x=y;
}

void rmain(){
    read(n);
    rep(i,0,n){
        memset(f[i],0x3f,sizeof f[i]);
    }
    rep(i,1,n){
        read(a[i]);
        sa[i]=sa[i-1]+a[i];
    }
    rep(i,1,n){
        read(b[i]);
        sb[i]=sb[i-1]+b[i];
    }
    f[0][0]=0;
    rep(i,1,n){
        rep(j,0,i-1){
            if(f[i-1][j]>=inf) continue;
            cmin(f[i][j],f[i-1][j]);
            if(sb[i]>=f[i-1][j]+a[i]){
                cmin(f[i][j+1],f[i-1][j]+a[i]);
            }
        }
    }
    int k=0;
    while(f[n][k+1]<inf) k++;
    cout<<k<<endl;
}

int main(){
    int T; read(T);
    while(T--) rmain();
    return 0;
}