#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#include <sstream>
#include <list>
#include <assert.h>
#include <bitset>
#include <numeric>
#include <unordered_map>
#define debug() puts("++++")
#define print(x) cout<<(x)<<endl
// #define gcd(a, b) __gcd(a, b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x)*(x))
#define ms(a,b) memset(a, b, sizeof a)
#define sz size()
#define be begin()
#define ed end()
#define pu push_up
#define pd push_down
#define cl clear()
#define lowbit(x) -x&x
#define all 1,n,1
#define FOR(i,n,x)  for(int i = (x); i < (n); ++i)
#define freopenr freopen("in.in", "r", stdin)
#define freopenw freopen("out.out", "w", stdout)
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const LL LNF = 1e17;
const double inf = 1e20;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 2e3 + 7;
const int maxm = 2000000 + 7;
const LL mod = 1e9 + 7;
const int dr[] = {-1, 1, 0, 0, 1, 1, -1, -1};
const int dc[] = {0, 0, 1, -1, 1, -1, 1, -1};
int n, m;

inline bool is_in(int r, int c) {
  return r >= 0 && r < n && c >= 0 && c < m;
}
inline int readInt(){
  int x;  scanf("%d", &x);  return x;
}

LL a[maxn], b[maxn];

unordered_map<int, int> mp;

struct Task{
  LL l, r, len;
  bool  operator < (const Task &t) const{
    if(len != t.len)  return len < t.len;
    if(r != t.r)  return r > t.r;
    return l > t.l;
  }
};

int main(){
  int T;  scanf("%d", &T);
  while(T--){
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)  scanf("%lld", a + i);
    for(int i = 1; i <= n; ++i)  scanf("%lld", b + i), b[i] += b[i-1];
    priority_queue<Task> pq;
    LL time = 0;
    for(int i = 1; i <= n; ++i){
      if(a[i] + time <= b[i]){
        pq.push((Task){time, a[i]+time, a[i]});
        time += a[i];
      }
      else if(!pq.empty()){
        Task t = pq.top();
        if(time + a[i] - t.len <= b[i]){
          pq.pop();
          pq.push((Task){time-t.len, time-t.len+a[i], a[i]});
          time += a[i] - t.len;
        }
      }
    }
    printf("%d\n", pq.sz);


  }
  return 0;
}