#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
constexpr ll mod = 1e9 + 7;
#define endl '\n'


template <typename A, typename B>
string to_string(pair<A, B> p);
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
 
string to_string(const string& s) {
  return '"' + s + '"';
}
 
string to_string(const char c) {
  return string(1,c);
}

string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
 
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (int i = int(N)-1; i >= 0; --i) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
 
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef COMPETITIVE_PROGRAMMING_LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define dbg(...) if(0){}
#endif


void Iter(ll& im, vector<array<ll,3>>& M, set<ll>& paid, set<ll>& free) {
  ll n = M.size();
  while (im < n) {
    if (paid.count(M[im][2])) {
      ++im;
      continue;
    }
    if (paid.size() + free.size() < M[im][0]) return;
    free.emplace(M[im++][2]);
  }
}
int main() {
  ios::sync_with_stdio(0); cin.tie(0);

  int TT = 1;
  cin >> TT;
  while (TT--) { 
    ll n;
    cin >> n;
    vector<array<ll,3>> A(n);
    for (ll i = 0; i < n; ++i) {
      cin >> A[i][0] >> A[i][1];
      A[i][2] = i;
    }
    vector<array<ll,3>> M = A;
    vector<array<ll,3>> P = A;
    sort(P.begin(), P.end(), [](const auto& a, const auto& b) {
                               return a[1] < b[1] || (a[1] == b[1] && a[0] > b[0]);
                             });
    sort(M.begin(), M.end(), [](const auto& a, const auto& b) {
                               return a[0] < b[0] || (a[0]==b[0] && a[1] > b[1]);
                             });
    ll im = 0;
    set<ll> paid, free;
    multiset<array<ll,3>> paid_helper;

    Iter(im, M, paid, free);
    for (ll i = 0; i < n; ++i) {
      if (free.count(P[i][2])) continue;
      paid.emplace(P[i][2]);
      paid_helper.insert({P[i][0], -P[i][1], P[i][2]});
//      dbg(paid_helper);
      if (paid.size() + free.size() > (*paid_helper.begin())[0]) {
        free.emplace((*paid_helper.begin())[2]);
        paid.erase((*paid_helper.begin())[2]);
        paid_helper.erase(paid_helper.begin());
      }

      Iter(im, M, paid, free);
    }
    

    ll ans = 0;
    for (ll i = 0; i < n; ++i) {
      if (paid.count(i)) {
//        dbg(i,A[i][1]);
        ans += A[i][1];
      }
    }
    cout << ans << endl;
  }
}
/*
ANS:
192392529

*/
