9.9B

题目链接https://vjudge.net/problem/27861/origin

Ilya plays a card game by the following rules.

A player has several cards. Each card contains two non-negative integers inscribed, one at the top of the card and one at the bottom. At the beginning of the round the player chooses one of his cards to play it. If the top of the card contains number ai, and the bottom contains number bi, then when the player is playing the card, he gets ai points and also gets the opportunity to play additional bi cards. After the playing the card is discarded.

More formally: let’s say that there is a counter of the cards that can be played. At the beginning of the round the counter equals one. When a card is played, the counter decreases by one for the played card and increases by the number bi, which is written at the bottom of the card. Then the played card is discarded. If after that the counter is not equal to zero, the player gets the opportunity to play another card from the remaining cards. The round ends when the counter reaches zero or the player runs out of cards.

Of course, Ilya wants to get as many points as possible. Can you determine the maximum number of points he can score provided that you know his cards?

Input
The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of cards Ilya has.

Each of the next n lines contains two non-negative space-separated integers — ai and bi (0 ≤ ai, bi ≤ 104) — the numbers, written at the top and the bottom of the i-th card correspondingly.

Output
Print the single number — the maximum number of points you can score in one round by the described rules.

Examples
Input
2
1 0
2 0
Output
2
Input
3
1 0
2 0
0 2
Output
3

简单的水题，有N张牌，每张有两个点数，第一个点数代表得分，第二个点数代表能量，起始有一点能量，每打出一张牌消耗一点能量，得到对应牌的分数和能量，求最多能得多少分。
先贴代码。

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
	int a,b;
}t[1010];
bool cmp(node a,node b)
{
	if(a.b==b.b)
	{
		return a.a>b.a;
	}
	else
	{
		return a.b>b.b;
	}
}
int main ()
{
	int n;
	
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>t[i].a>>t[i].b;		
	}
	sort(t,t+n,cmp);
	int cnt=1;
	int sum=0;
	int i=0;
	while(1)
	{
		sum+=t[i].a;
		cnt--;
		cnt+=t[i].b;
		if(cnt==0||i==n-1)
		{
			break;
		}		
		i++;		
	}
	cout<<sum<<endl;	
} 

结构体排序一下，优先能量最多的，同能量分数最多的。