CF A. Feed with Candy （贪心算法模拟题）

http://codeforces.com/contest/436/problem/A

The hero of the Cut the Rope game is a little monster named Om Nom. He loves candies. And what a coincidence! He also is the hero of today's problem.

$\text{[math]}$

One day, Om Nom visited his friend Evan. Evan has n candies of two types (fruit drops and caramel drops), the i-th candy hangs at the height of hi centimeters above the floor of the house, its mass is mi. Om Nom wants to eat as many candies as possible. At the beginning Om Nom can make at most x centimeter high jumps. When Om Nom eats a candy of mass y, he gets stronger and the height of his jump increases by y centimeters.

What maximum number of candies can Om Nom eat if he never eats two candies of the same type in a row (Om Nom finds it too boring)?

Input

The first line contains two integers, n and x (1 ≤ n, x ≤ 2000) — the number of sweets Evan has and the initial height of Om Nom's jump.

Each of the following n lines contains three integers ti, hi, mi (0 ≤ ti ≤ 1; 1 ≤ hi, mi ≤ 2000) — the type, height and the mass of thei-th candy. If number ti equals 0, then the current candy is a caramel drop, otherwise it is a fruit drop.

Output

Print a single integer — the maximum number of candies Om Nom can eat.

Sample test(s)

input

output

Note

One of the possible ways to eat 4 candies is to eat them in the order: 1, 5, 3, 2. Let's assume the following scenario:

Initially, the height of Om Nom's jump equals 3. He can reach candies 1 and 2. Let's assume that he eats candy 1. As the mass of this candy equals 4, the height of his jump will rise to 3 + 4 = 7.
Now Om Nom can reach candies 2 and 5. Let's assume that he eats candy 5. Then the height of his jump will be 7 + 5 = 12.
At this moment, Om Nom can reach two candies, 2 and 3. He won't eat candy 2 as its type matches the type of the previously eaten candy. Om Nom eats candy 3, the height of his jump is 12 + 3 = 15.
Om Nom eats candy 2, the height of his jump is 15 + 1 = 16. He cannot reach candy 4.

////////////////////////////////////////////////////////////////////////////////////////////////////////////////

贪心算法，依次求最优解，并且两种情况枚举求最大值即为题解

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>

using namespace std;
struct Node
{
    int t,h,m;
}f[2010];

int cmp(Node a,Node b)
{
    return a.m>b.m;
}

Node a[2010],b[2010];

int main()
{
    int n,m,i,j;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int ti,hi,mi;
        for(i=1;i<=n;i++)
        {
            scanf("%d%d%d",&ti,&hi,&mi);
            a[i].t=ti;b[i].t=ti;
            a[i].h=hi;b[i].h=hi;
            a[i].m=mi;b[i].m=mi;
        }

        sort(a+1,a+n+1,cmp);
        sort(b+1,b+n+1,cmp);

        int drop=m,sum=0,flag=0;
        for(i=1;i<=n;i++)
        {
            if(drop>=a[i].h&&a[i].t==flag)
            {
                drop+=a[i].m;
                sum++;
                a[i].t=-1;
                flag=1-flag;//转换为另一种糖
                i=0;//循环查找最优
            }
        }

        drop=m,flag=1;
        int s=0;
        for(i=1;i<=n;i++)
        {
            if(drop>=b[i].h&&b[i].t==flag)
            {
                drop+=b[i].m;
                s++;
                b[i].t=-1;
                flag=1-flag;
                i=0;
            }
        }
        printf("%d\n",sum>s?sum:s);
    }
    return 0;
}