#include<stdio.h>

#include<iostream>

#include<string.h>

#include<algorithm>

using namespace std;

struct HomeWork

{

    int deadline;

    int reduce;

} hw[];

bool mark[];

int t;

int n;

int search(HomeWork a[],int x,int len)

{

    int i,pl=-,min=x;

    for(i=; i<len; i++)

        if(mark[i]==true&&a[i].reduce<min)

        {

            min=a[i].reduce;

            pl=i;

        }

    return pl;

}

bool cmp(HomeWork a ,HomeWork b)

{

    if(a.deadline!=b.deadline)

        return a.deadline<b.deadline;

    else

        return a.reduce>b.reduce;

}

int main()

{

    scanf("%d",&t);

    while(t--)

    {

        memset(mark,,sizeof(mark));

        memset(hw,,sizeof(hw));

        int i;

        scanf("%d",&n);

        for(i=; i<n; i++)

            scanf("%d",&hw[i].deadline);

        for(i=; i<n; i++)

            scanf("%d",&hw[i].reduce);

        sort(hw,hw+n,cmp);

        int day=,reduced=,tmp;

        for(i=; i<n; i++)

        {

            if(day<hw[i].deadline)

            {

                day++;

                mark[i] = true;

            }

            else

            {

                int ex = search(hw,hw[i].reduce,i);

                if(ex!=-)

                {

                    tmp=hw[ex].reduce;

                    hw[ex].reduce = hw[i].reduce;

                    hw[i].reduce=tmp;

                }

                reduced += hw[i].reduce;

            }

        }

        printf("%d\n",reduced);

    }

    return ;

}