#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <bitset>
#define int long long

using namespace std;

typedef long long ll;

ll A[2010], B[2010];

ll F[2010][2010];

void Solve() {
    int n;
    scanf("%lld", &n);
    for(int i = 1; i <= n; i++) scanf("%lld", &A[i]);
    for(int i = 1; i <= n; i++) scanf("%lld", &B[i]);
    memset(F, 233, sizeof F);
    F[0][0] = 0;
    for(int i = 1; i <= n; i++)
        for(int j = 0; j < i; j++) {
            // 不做
            F[i][j] = max(F[i][j], F[i - 1][j] + B[i]);
            // 做
            if(F[i - 1][j] + B[i] - A[i] >= 0)
                F[i][j + 1] = max(F[i][j + 1], F[i - 1][j] + B[i] - A[i]);
        }
    for(int i = n; i >= 0; i--)
        if(F[n][i] >= 0) {
            printf("%lld\n", i);
            return;
        }
}

#undef int
int main() {
    int test;
    scanf("%d", &test);
    while(test--) {
        Solve();
    }
}