#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
const int MAXN = 2e5 + 10;
int n;
pair<int, int> p[MAXN];
priority_queue<int, vector<int>, greater<int>> pq;
void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> p[i].first >> p[i].second;
  sort(p, p + n);
  while (pq.size()) pq.pop();
  long long ans = 0;
  int cnt = 0;
  for (int i = n - 1; ~i; i--) {
    pq.push(p[i].second);
    int temp = p[i].first - i - cnt;
    for (int j = 0; j < temp; j++) ans += pq.top(), pq.pop(), cnt++;
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  cin >> te;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
