#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<set>

 #include<cmath>

 using namespace std;

 const int maxn = 1e4 + ;

 typedef long long ll;

 int T, n, m;

 struct node

 {

     int time, score;

     bool operator <(const node& a)const

     {

         return score > a.score || score == a.score && time < a.time;

     }

 };

 node a[maxn];

 bool vis[maxn];

 int main()

 {

     cin >> T;

     while(T--)

     {

         cin >> n;

         memset(vis, , sizeof(vis));

         for(int i = ; i < n; i++)cin >> a[i].time;

         for(int i = ; i < n; i++)cin >> a[i].score;

         sort(a, a + n);

         int sum = ;

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

         {

             int ok = ;

             for(int j = a[i].time; j >= ; j--)

             {

                 if(!vis[j]){vis[j] = ok = ;break;}

             }

             if(!ok)sum += a[i].score;

         }

         cout<<sum<<endl;

     }

     return ;

 }