#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
#define N 1010
struct course
{
    int deadtime;
    int score;
    bool operator <(const course &t)const
    {
        if(score!=t.score) return score>t.score;
        return deadtime<t.deadtime;
    }
}s[N];
int main()
{
    int vis[N];
    int T,n,i,j;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        memset(vis,0,sizeof(vis));
        for(i=1;i<=n;i++)
        {
            scanf("%d",&s[i].deadtime);
        }
        for(i=1;i<=n;i++)
        {
            scanf("%d",&s[i].score);
        }
        sort(s+1,s+n+1);
        int ans=0;
        for(i=1;i<=n;i++)
        {
            for(j=s[i].deadtime;j>=1;j--)
            {
                if(!vis[j])
                {
                    vis[j]=1;
                    break;
                }
            }
            if(j==0) ans+=s[i].score;
        }
        cout<<ans<<endl;
    }
    return 0;
}