// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#else
#define debug(x...) {};
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define double long double
#define int long long
#define MAXN 200010

void solve() {
    int n; cin >> n;
    struct node {
        int a, b;
    };
    vector<node> f(n);
    int m = 0;
    rep(i, 0, n) {
        cin >> f[i].a >> f[i].b;
        cmax(m, f[i].a + 1);
    }
    vector<vector<int>> h(m);
    rep(i, 0, n) h[f[i].a].push_back(f[i].b);
    rep(i, 0, m) sort(h[i].begin(), h[i].end(), greater<int>());
    int x = 0, ans = 0;
    debug(h)
    vector<int> select(m, 0);
    rep(i, 0, m) {
        rep(j, 0, sz(h[i])) {
            if (i > x) {
                ++select[i];
                ++x, ans += h[i][j];
                int clr = x;
                x -= select[clr];
                select[clr] = 0;
                if (clr == i) break;
            }
        }
    }
    cout << ans << endl;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int _; cin >> _;
    while (_--) solve();

    return 0;
}