codeforces 725D Contest Balloons(贪心+优先队列)

D. Contest Balloons

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

One tradition of ACM-ICPC contests is that a team gets a balloon for every solved problem. We assume that the submission time doesn't matter and teams are sorted only by the number of balloons they have. It means that one's place is equal to the number of teams with more balloons, increased by 1. For example, if there are seven teams with more balloons, you get the eight place. Ties are allowed.

You should know that it's important to eat before a contest. If the number of balloons of a team is greater than the weight of this team, the team starts to float in the air together with their workstation. They eventually touch the ceiling, what is strictly forbidden by the rules. The team is then disqualified and isn't considered in the standings.

A contest has just finished. There are n teams, numbered 1 through n. The i-th team has ti balloons and weight wi. It's guaranteed that tidoesn't exceed wi so nobody floats initially.

Limak is a member of the first team. He doesn't like cheating and he would never steal balloons from other teams. Instead, he can give his balloons away to other teams, possibly making them float. Limak can give away zero or more balloons of his team. Obviously, he can't give away more balloons than his team initially has.

What is the best place Limak can get?

Input

The first line of the standard input contains one integer n (2 ≤ n ≤ 300 000) — the number of teams.

The i-th of n following lines contains two integers ti and wi (0 ≤ ti ≤ wi ≤ 1018) — respectively the number of balloons and the weight of the i-th team. Limak is a member of the first team.

Output

Print one integer denoting the best place Limak can get.

Examples

input

8
20 1000
32 37
40 1000
45 50
16 16
16 16
14 1000
2 1000

output

3

input

7
4 4
4 4
4 4
4 4
4 4
4 4
5 5

output

2

input

7
14000000003 1000000000000000000
81000000000 88000000000
5000000000 7000000000
15000000000 39000000000
46000000000 51000000000
0 1000000000
0 0

output

2

Note

In the first sample, Limak has 20 balloons initially. There are three teams with more balloons (32, 40 and 45 balloons), so Limak has the fourth place initially. One optimal strategy is:

1. Limak gives 6 balloons away to a team with 32 balloons and weight 37, which is just enough to make them fly. Unfortunately, Limak has only 14 balloons now and he would get the fifth place.
2. Limak gives 6 balloons away to a team with 45 balloons. Now they have 51 balloons and weight 50 so they fly and get disqualified.
3. Limak gives 1 balloon to each of two teams with 16 balloons initially.
4. Limak has 20 - 6 - 6 - 1 - 1 = 6 balloons.
5. There are three other teams left and their numbers of balloons are 40, 14 and 2.
6. Limak gets the third place because there are two teams with more balloons.

In the second sample, Limak has the second place and he can't improve it.

In the third sample, Limak has just enough balloons to get rid of teams 2, 3 and 5 (the teams with 81 000 000 000, 5 000 000 000 and 46 000 000 000 balloons respectively). With zero balloons left, he will get the second place (ex-aequo with team 6 and team 7).

题意：每只队伍有自己的气球量和体重，按照气球量将队伍排名，当气球量大于体重人就飘走了，不再计入排名。 一个人是XXX，他可以给气球比他多的队伍送气球，使其飘走。 问XXX能获得最好名次是多少？

题解：~~~~(>_<)~~~~ C题卡了一个半小时，错失这么和善的D题，依旧咸鱼 (。﹏。)   首先咱们将每个队伍按照气球量从大到小排序，将大于XXX的队伍压入队列，在队列中按照 体重-气球量+1 从小到大排序。 当XXX的气球减少时，就需要把之前没进入队列但此时气球量大于XXX的队伍压入队列，不断更新最小ans

代码如下:（第一次在代码里面加空格，好看多了，大括号不换行 (๑•ᴗ•๑)

#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn = 300000+10;
#define LL long long 
struct node{
	LL num, weight, cnt;
}a[maxn];

LL cmp(node x, node y){
	return x.num > y.num;
}

bool operator < (const node &x, const node &y){
	return x.cnt > y.cnt;
}

int main()
{
	int n, i, j;
	while(cin>>n){
		for(i = 0; i < n; ++i){
			scanf("%lld %lld",&a[i].num, &a[i].weight);
			a[i].cnt = a[i].weight + 1 - a[i].num; 
		}
		sort(a+1, a+n, cmp);
		priority_queue<node>q;
		for(i = 1; i < n; ++i){
			if(a[i].num > a[0].num)
				q.push(a[i]);
			else
				break;
		}
		LL step = i, ans = i;
		while(!q.empty()){
			node temp = q.top();
			q.pop();
			a[0].num -= temp.cnt;
			if(a[0].num < 0)
				break;
			for(j = i; j < n; ++j){
				if(a[j].num > a[0].num)
					q.push(a[j]);
				else
					break;
			}
			step += j-i-1;
			i=j;
			ans = min(ans, step);
		}
		cout<<ans<<endl; 	
	}
	return 0;
}