Educational Codeforces Round 75 E2. Voting（堆）

题目描述

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 pi coins. The second way is to make mi 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 m1=1, m2=2, m3=2, m4=4, m5=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→1,5→1,2,3,5→1,2,3,4,5.
Calculate the minimum number of coins you have to spend so that everyone votes for you.

Input

The first line contains one integer t (1≤t≤5000) — the number of test cases.
The first line of each test case contains one integer n (1≤n≤5000) — the number of voters.
The next n lines contains the description of voters. i-th line contains two integers mi and pi (1≤pi≤109,0≤mi<n).
It is guaranteed that the sum of all n over all test cases does not exceed 5000.

Output

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

Example

input
3
3
1 5
2 10
2 8
7
0 1
3 1
1 1
6 1
1 1
4 1
4 1
6
2 6
2 3
2 8
2 7
4 4
5 5
output
8
0
7

Note

In the first test case you have to buy vote of the third voter. Then the set of people voting for you will change as follows: 3→1,3→1,2,3.
In the second example you don’t need to buy votes. The set of people voting for you will change as follows: 1→1,3,5→1,2,3,5→1,2,3,5,6,7→1,2,3,4,5,6,7.
In the third test case you have to buy votes of the second and the fifth voters. Then the set of people voting for you will change as follows: 2,5→1,2,3,4,5→1,2,3,4,5,6.

题目大意

你想去参加一个选举，这个选举有n个人投票，你希望所有人都能选你。让第i个人选你的方法有两个：1.给这个人p[i]块钱。2.有m[i]个别人选了你。问让所有人都选你的最小花费是多少。

题目分析

要想花钱最少，就要让能免费给你投票的尽可能的给你免费投票。因此我们要让m[i]从大到小进行计算。
设x为没有给你投票的人，如果n-m[i]>=x，那么剩下的人就会给你免费投票。否则如果x>n-m[i]，你就需要收买一些人（x-(n-m[i])个）来使你的得票数增加。
我们可以维护一个优先队列（小根堆），从大到小遍历所有的m[i]，每次将这个m[i]对应的p[i]放入堆中，如果堆中元素大于n-m[i]时，那么说明：剩下还没投票的加上已经花钱买来的人都已经没法让他免费获得了票了，那就只能花钱买人。 可以利用小根堆的特性每次取出p[i]最小的收买，这样最后就能得到最小的花费。

代码如下

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <stack>
#include <map>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <iomanip>
#define LL long long
#define PII pair<int,int>
using namespace std;
const int N=2e5+5;
vector<int> a[N]; 	//放m[]和p[]，a[i][]表示m[]中为i的所有数对应的p[]
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n;
		scanf("%d",&n);
		for(int i=0;i<=n;i++) a[i].clear();
		for(int i=1;i<=n;i++)
		{
			int m,p;
			scanf("%d %d",&m,&p);
			a[m].push_back(p);
		}
		LL ans=0;
		priority_queue<int,vector<int>,greater<int> >heap;
		for(int i=n;i>=1;i--)	//m要从大到小进行遍历
		{
			for(int j=0;j<a[i].size();j++)	//每次将m[]中等于i的放入
				heap.push(a[i][j]);
			
			while(heap.size()&&heap.size()>n-i)
			{
				ans+=heap.top();		//每次贿赂p[i]最小的
				heap.pop();
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}