A13020 | Voting (Hard Version)

The only difference between easy and hard versions is constraints.

Now elections are held in Berland and you want to win them. More precisely, you want everyone to vote for you.

There are $n$ voters, and two ways to convince each of them to vote for you. The first way to convince the $i$ -th voter is to pay him $p_i$ coins. The second way is to make $m_i$ other voters vote for you, and the $i$ -th voter will vote for free.

Moreover, the process of such voting takes place in several steps. For example, if there are five voters with $m_1 = 1$ , $m_2 = 2$ , $m_3 = 2$ , $m_4 = 4$ , $m_5 = 5$ , then you can buy the vote of the fifth voter, and eventually everyone will vote for you. Set of people voting for you will change as follows: ${5} \rightarrow {1, 5} \rightarrow {1, 2, 3, 5} \rightarrow {1, 2, 3, 4, 5}$ .

Calculate the minimum number of coins you have to spend so that everyone votes for you.

The first line contains one integer $t$ ( $1 \le t \le 2 \cdot 10^5$ ) — the number of test cases.

The first line of each test case contains one integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ) — the number of voters.

The next $n$ lines contains the description of voters. $i$ -th line contains two integers $m_i$ and $p_i$ ( $1 \le p_i \le 10^9, 0 \le m_i < n$ ).

It is guaranteed that the sum of all $n$ over all test cases does not exceed $2 \cdot 10^5$ .

For each test case print one integer — the minimum number of coins you have to spend so that everyone votes for you.