import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.PriorityQueue;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author MaxHeap
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        E1VotingEasyVersion solver = new E1VotingEasyVersion();
        int testCount = Integer.parseInt(in.next());
        for (int i = 1; i <= testCount; i++)
            solver.solve(i, in, out);
        out.close();
    }

    static class E1VotingEasyVersion {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            List<Integer>[] cost = Graphs.createGraph(n + 1);
            for (int i = 0; i < n; i++) {
                int m = in.nextInt(), p = in.nextInt();
                cost[m].add(p);
            }
            PriorityQueue<Long> pq = new PriorityQueue<>();
            long ans = 0;
            for (int votes = n; votes >= 0; --votes) {
                for (int price : cost[votes]) {
                    pq.add((long) price);
                }
                while (true) {
                    if (pq.size() <= n - votes) break;
                    ans += pq.poll();
                }
            }
            out.println(ans);
        }

    }

    static class InputReader {
        private InputStream stream;
        private static final int DEFAULT_BUFFER_SIZE = 1 << 16;
        private static final int EOF = -1;
        private byte[] buf = new byte[DEFAULT_BUFFER_SIZE];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (this.numChars == EOF) {
                throw new UnknownError();
            } else {
                if (this.curChar >= this.numChars) {
                    this.curChar = 0;

                    try {
                        this.numChars = this.stream.read(this.buf);
                    } catch (IOException ex) {
                        throw new InputMismatchException();
                    }

                    if (this.numChars <= 0) {
                        return EOF;
                    }
                }

                return this.buf[this.curChar++];
            }
        }

        public int nextInt() {
            int c;
            for (c = this.read(); isSpaceChar(c); c = this.read()) {
            }

            byte sgn = 1;
            if (c == 45) {
                sgn = -1;
                c = this.read();
            }

            int res = 0;

            while (c >= 48 && c <= 57) {
                res *= 10;
                res += c - 48;
                c = this.read();
                if (isSpaceChar(c)) {
                    return res * sgn;
                }
            }

            throw new InputMismatchException();
        }

        public String next() {
            int c;
            while (isSpaceChar(c = this.read())) {
            }

            StringBuilder result = new StringBuilder();
            result.appendCodePoint(c);

            while (!isSpaceChar(c = this.read())) {
                result.appendCodePoint(c);
            }

            return result.toString();
        }

        public static boolean isSpaceChar(int c) {
            return c == 32 || c == 10 || c == 13 || c == 9 || c == EOF;
        }

    }

    static abstract class Graphs {
        public static List<Integer>[] createGraph(int n) {
            List<Integer>[] res = new ArrayList[n];
            for (int i = 0; i < n; ++i) {
                res[i] = new ArrayList<>();
            }
            return res;
        }

    }
}

