CodeForces 155B - Combination（贪心）

B. Combination

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Sample test(s)

input

2
1 0
2 0

output

2

input

3
1 0
2 0
0 2

output

3

Note

In the first sample none of two cards brings extra moves, so you should play the one that will bring more points.

In the second sample you should first play the third card that doesn't bring any points but lets you play both remaining cards.

================================

a是分数，b是能再玩的卡片数，贪心，对卡片数排序，先玩能得卡片数多的必然能得到最多的分数

#include<iostream>
#include<cstdio>
#include <algorithm>

using namespace std;

struct card
{
    int top;
    int bot;
}s[1111];

bool cmp(card a,card b)
{
    if(a.bot==b.bot) return a.top>b.top;
    return a.bot>b.bot;
}

int main()
{
    int n,cnt=1,ans=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d%d",&s[i].top,&s[i].bot);
    }
    sort(s,s+n,cmp);
    for(int i=0;i<n;i++)
    {
        if(cnt)
        {
            ans+=s[i].top;
            cnt--;
            cnt+=s[i].bot;
        }
        else break;
    }
    printf("%d\n",ans);
    return 0;
}