#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;

int visi[1005];
struct node
{
    int time;
    int score;
}nod[1005];

int cmp(node a,node b)
{
    if(a.score>b.score) return 1;
    if(a.score==b.score&&a.time>b.time) return 1;
    return 0;
}

int main()
{
    int tes,n;
    cin>>tes;

    int i,j;
    int res;
    while(tes--)
    {
        res=0;
        cin>>n;
        for(i=0;i<n;i++)
            scanf("%d",&nod[i].time);
        for(i=0;i<n;i++)
            scanf("%d",&nod[i].score);

        sort(nod,nod+n,cmp);
        memset(visi,0,sizeof(visi));

        for(i=0;i<n;i++)
        {
            int flag=0;
            j=nod[i].time;
            while(j)
            {
                if(!visi[j])
                {
                    visi[j]=1;
                    flag=1;
                    break;
                }
                j--;
            }
            if(!flag)
                res+=nod[i].score;
        }

        cout<<res<<endl;
    }
    return 0;
}

/*
3
3
3 3 3
10 5 1
3
1 3 1
6 2 3
7
1 4 6 4 2 4 3
3 2 1 7 6 5 4
*/