#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
#define M 1000
#define N 100
struct node{
int time,s;
}dp[M];
bool cmp(node x,node y)
{
    if(x.s==y.s)
    return x.time<y.time;
    return x.s>y.s;
}
int map[M];
int main()
{
    int i,j,n,m;
    cin>>m;
    while(m--)
    {
        cin>>n;
        int cur=0;
        memset(map,0,sizeof(0));
        for(i=0;i<n;i++) cin>>dp[i].time;
        for(i=0;i<n;i++) cin>>dp[i].s;
        sort(dp,dp+n,cmp);
        memset(map,0,sizeof(map));
        for(i=0;i<n;i++)
        {
        for(j=dp[i].time;j>0;j--)
        {
          if(!map[j]) {map[j]=1;break;}
        }
        if(j==0) cur+=dp[i].s;
        }
        cout<<cur<<endl;
    }
    return 0;
}