#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

#define maxn 10005

using namespace std;

int used[maxn];

struct node

{

	int d,p;

} a[maxn];

int cmp(node n1,node n2)

{

	return n1.p>n2.p;

}

int main()

{

	int ncase,n,i,j,ans;

	scanf("%d",&ncase);

	while(ncase--)

	{

		scanf("%d",&n);

		for(i=1;i<=n;i++) scanf("%d",&a[i].d);

		for(i=1;i<=n;i++) scanf("%d",&a[i].p);

		sort(a+1,a+1+n,cmp);

		memset(used,0,sizeof(used));

		ans=0;

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

		{

			for(j=a[i].d;j>=1;j--)

			{

				if(!used[j])

				{

					used[j]=1;

					break;

				}

			}

			if(j==0) ans+=a[i].p;

		}

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

	}

}