#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int maxn = 2e3 + 70;
const int INF = 0x3f3f3f3f;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
const double eps = 1e-7;
const double PI = acos(-1.0);

int n, m, k;

int a[maxn], b[maxn];

ll dp[maxn][maxn];

int main(){
    //freopen("in.txt", "r", stdin);
    int T; cin>>T;
    while(T--){
        cin>>n;
        for(int i=1;i<=n;i++) scanf("%d",&a[i]);
        for(int i=1;i<=n;i++) scanf("%d",&b[i]);

        dp[0][0] = 0;
        for(int i=1;i<=n;i++){
            for(int j=0;j<=i;j++){
                dp[i][j] = -inf;
                if(j < i) dp[i][j] = max(dp[i][j], dp[i-1][j] + b[i]);
                if(j && dp[i-1][j-1] + b[i] >= a[i]) dp[i][j] = max(dp[i][j], dp[i-1][j-1] + b[i] - a[i]);
                //cout<<i<<" "<<j<<": "<<dp[i][j]<<endl;
            }
        }

        int ans = 0;
        for(int j=n;j>=1;j--) if(dp[n][j] >= 0) {ans = j; break;}
        printf("%d\n",ans);
    }
    return 0;
}