#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<assert.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define INF 1000000000

int n;
int d[501], s[501];
int dp[1001];

int main(){
  int T;
  
  int i,j,k,mx;
  int res;

  assert( scanf("%d",&T)==1 );
  assert( 1<=T && T<=500 );
  while(T--){
    assert(scanf("%d",&n)==1);
    assert(1<=n && n<=500);
    rep(i,n) assert( scanf("%d",d+i)==1 ), assert( 1<=d[i] && d[i]<=500 );
    rep(i,n) assert( scanf("%d",s+i)==1 ), assert( 1<=s[i] && s[i]<=500 );

    mx = 0;
    rep(i,n) if(mx < d[i]) mx = d[i];

    /* dp[i] denotes minimum times of visiting for obtaining exactly fuel i */
    rep(i,2*mx+1) dp[i] = INF;
    dp[0] = 0;

    rep(i,n) REP(j,s[i],2*mx+1) if(dp[j] > dp[j-s[i]]+1) dp[j] = dp[j-s[i]]+1;

    res = 0;
    rep(i,n) res += dp[d[i]*2];

    assert(1<=res && res<=n*2*mx);
    
    printf("%d\n",res);
  }

  return 0;
}