#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
using namespace std;
using ll = long long;
template <class T>
using V = vector<T>;
template <class T, class U>
using P = pair<T, U>;
using vll = V<ll>;
using vii = V<int>;
using vvll = V<vll>;
using vvii = V<V<int> >;
using PII = P<int, int>;
using PLL = P<ll, ll>;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;
void solve() {
  int n;
  cin >> n;
  vvii pm(n + 1);
  for (ll i = 0; i < n; i++) {
    int m, p;
    cin >> m >> p;
    pm[m].emplace_back(p);
  }
  ll ans = 0;
  int rem = n, add = 0;
  multiset<int> pset;
  for (ll i = n - 1; i > -1; i--) {
    rem -= int(pm[i].size());
    for (int p : pm[i]) pset.insert(p);
    int tmp = i - rem;
    while (add < tmp) {
      ans += *pset.begin();
      pset.erase(pset.begin());
      add++;
    }
  }
  cout << ans << '\n';
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  while (t-- > 0) {
    solve();
  }
  return 0;
}
