#pragma GCC target("avx2")
#pragma GCC optimize("O3")
   
#include <x86intrin.h>
#include <bits/stdc++.h>   
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;

template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
     
#define F first
#define S second           
#define lb lower_bound               
#define ub upper_bound
#define pb push_back
#define pf push_front    
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll                                                                                        
#define sqr(x) ((x) * (x)) 
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
#define int long long
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
 
const int mod = (int)1e9 + 7;
const int N = (int)3e5 + 123;
const ll inf = (ll)1e18 + 1;

const double pi = acos (-1.0);
const double eps = 1e-7;                  
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};

int n, ans, dp[5001][5001], used[5001];
pii p[N];

inline void boost () {                    
   ios_base :: sync_with_stdio (NULL);
   cin.tie (NULL), cout.tie (NULL);          
}                                                     

inline void Solve () {
   cin >> n;
   int has = 0;
   ans = 0;
   for (int i = 1; i <= n; i ++) cin >> p[i].S >> p[i].F, used[i] = 0;
   while (has < n) {
      bool ok = 0;
      for (int i = 1; i <= n; i ++)
         if (has >= p[i].S && !used[i])
            has ++, ok = 1, used[i] = 1;   
      if (!ok) {
         int pos = -1;
         int cur = 0;
         for (int i = 1; i <= n; i ++) {
            if (used[i]) continue;
            if ((pos == -1 || p[i].S < p[pos].S))
               pos = i, cur = 1;
            else if (p[pos].S == p[i].S) cur ++;
         }
         if (cur > 1 && p[pos].F - has == 1) {
            ans += p[pos].F;
            used[pos] = 1;
            has ++;        
         }
         else {
            int pos1 = -1;
            for (int i = 1; i <= n; i ++) {
               if (used[i]) continue;
               if (p[i].S == p[pos].S && cur == 1) continue;
               if (pos1 == -1 || (p[pos1].F > p[i].F || (p[pos1].F == p[i].F && p[pos1].S < p[i].F))) pos1 = i;
            }
            ans += p[pos1].F;
            used[pos1] = 1;
            has ++;
         }
      }
   }
   cout << ans << endl;
   
}

main () {                                       
// freopen (".in", "r", stdin);    
// freopen (".out", "w", stdout);              
   boost ();
   int tt = 1;
   cin >> tt;   
   while (tt --) {
      Solve ();
   }                                               
   return 0;      
}
                          