1 #include <cstdio>
 2 #include <cstring>
 3 #include <algorithm>
 4 using namespace std;
 5 
 6 const int MAX = 1050;
 7 struct Homework
 8 {
 9     int s;
10     int d;
11 };
12 typedef Homework H;
13 H h[MAX];
14 bool u[MAX];
15 bool compare(const H& h1, const H& h2)
16 {
17     if (h1.s>h2.s)
18         return true;
19     else if (h1.s == h2.s && h1.d<h2.d)
20         return true;
21     else
22         return false;
23 }
24 
25 int solute(int n)
26 {
27     int j, score = 0;
28     for (int i = 0; i < n; i++)
29     {
30         for (j = h[i].d; j > 0; j--)
31         {
32             if (!u[j])
33             {
34                 u[j] = true;
35                 break;
36             }
37         }
38         if (j == 0)
39             score += h[i].s;
40     }
41     return score;
42 }
43 int main()
44 {
45     int t, n, pos;
46     scanf("%d", &t);
47     while (t--)
48     {
49         scanf("%d", &n);
50         memset(u, 0, sizeof(u));
51         for (int i = 0; i < n; i++)
52             scanf("%d", &h[i].d);
53 
54         for (int i = 0; i<n; i++)
55             scanf("%d", &h[i].s);
56 
57         sort(h, h + n, compare);
58 
59         printf("%d\n", solute(n));
60     }
61 
62 }