#include <bits/stdc++.h>
using namespace std;
long long int INF = 3e18;
const long long fact_table = 5000000;
double Pi = 3.1415926535897932384626;
vector<pair<long long, long long> > tree[500010];
priority_queue<long long> pql;
priority_queue<pair<long long, long long> > pqp;
priority_queue<long long, vector<long long>, greater<long long> > pqls;
priority_queue<pair<long long, long long>, vector<pair<long long, long long> >,
               greater<pair<long long, long long> > >
    pqps;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
long long mod = 1000000007;
long long rui(long long number1, long long number2) {
  if (number2 == 0) {
    return 1;
  } else {
    long long number3 = rui(number1, number2 / 2);
    number3 *= number3;
    number3 %= mod;
    if (number2 % 2 == 1) {
      number3 *= number1;
      number3 %= mod;
    }
    return number3;
  }
}
long long gcd(long long number1, long long number2) {
  if (number1 > number2) {
    swap(number1, number2);
  }
  if (number1 == 0 || number1 == number2) {
    return number2;
  } else {
    return gcd(number2 % number1, number1);
  }
}
void YES(bool condition) {
  if (condition) {
    cout << "YES"
         << "\n";
    ;
  } else {
    cout << "NO"
         << "\n";
    ;
  }
  return;
}
void Yes(bool condition) {
  if (condition) {
    cout << "Yes"
         << "\n";
    ;
  } else {
    cout << "No"
         << "\n";
    ;
  }
  return;
}
long long n, m, num, sum, a, b, c, d, e, g, h, w, i, j, q, r, l;
long long k;
long long ans;
long long x[500005], y[500005], z[500005];
pair<long long, long long> table[500005];
long long s;
void solve() {
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> a >> b;
    table[i].first = a;
    table[i].second = b;
  }
  sort(table, table + n);
  for (long long i = 0; i < n; i++) {
    x[i] = i;
    y[i] = table[i].first - x[i];
  }
  long long idx = n - 1;
  long long deleted = 0;
  long long cost = 0;
  pqls.push(INF);
  while (1) {
    if (idx > 0 && table[idx].first == table[idx - 1].first) {
      pqls.push(table[idx].second);
    } else {
      pqls.push(table[idx].second);
      long long norma = y[idx] - deleted;
      if (norma <= 0) {
        idx--;
        if (idx == -1) break;
        continue;
      }
      while (norma--) {
        long long add = pqls.top();
        if (add == INF) {
          assert(1 == 0);
          return;
        } else {
          pqls.pop();
          cost += add;
          deleted++;
        }
      }
    }
    idx--;
    if (idx == -1) break;
  }
  cout << cost << "\n";
  ;
  while (!pqls.empty()) pqls.pop();
  return;
}
int main() {
  cin >> q;
  for (long long idx = 0; idx < q; idx++) {
    solve();
  }
  return 0;
}
