#include <bits/stdc++.h>
using namespace std;
int spf[101];
int fac[101];
void sieve() {
  spf[1] = 1;
  for (int i = 2; i < 101; i++) spf[i] = i;
  for (int i = 4; i < 101; i += 2) spf[i] = 2;
  for (int i = 3; i * i < 101; i++) {
    if (spf[i] == i) {
      for (int j = i * i; j < 101; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
map<int, int> getfactor(int a) {
  map<int, int> m;
  while (a > 1) {
    m[spf[a]]++;
    a /= spf[a];
  }
  return m;
}
int power(int x, int y, int p) {
  int res = 1;
  x = x % p;
  if (x == 0 || y < 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int inverse(int a, int p) { return power(a, p - 2, p); }
int ncr(int n, int r, int p) {
  if (r > n) return 0;
  if (r == 0 || r == n) return 1;
  return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p;
}
void solve() {
  int n;
  cin >> n;
  pair<int, int> q[n + 1];
  multiset<pair<int, int> > s;
  multiset<int, greater<int> > s2;
  for (int i = 1; i <= n; i++) {
    cin >> q[i].first >> q[i].second;
  }
  sort(q + 1, q + n + 1);
  for (int i = 1; i <= n; i++) s.insert(make_pair(q[i].second, i));
  int ans = 0, ct = 0;
  for (int i = 1; i <= n; i++) {
    if (ct >= q[i].first) {
      if (s.find(make_pair(q[i].second, i)) != s.end()) {
        s.erase(s.find(make_pair(q[i].second, i)));
        ct++;
      } else
        s2.insert(q[i].second);
    } else {
      while (ct < q[i].first && s2.size()) {
        ans += s.begin()->first;
        ans -= *s2.begin();
        s2.erase(s2.begin());
        s.erase(s.begin());
        ct++;
      }
      while (ct < q[i].first) {
        ans += s.begin()->first;
        s.erase(s.begin());
        ct++;
      }
      if (s.find(make_pair(q[i].second, i)) != s.end()) {
        s.erase(s.find(make_pair(q[i].second, i)));
        ct++;
      } else
        s2.insert(q[i].second);
    }
  }
  cout << ans << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int test = 1;
  cin >> test;
  while (test--) {
    solve();
  }
}
