CF Zepto Code Rush 2014 A - Feed with Candy

Feed with Candy

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

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 h_i centimeters above the floor of the house, its mass is m_i. 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 t_i, h_i, m_i (0 ≤ t_i ≤ 1; 1 ≤ h_i, m_i ≤ 2000) — the type, height and the mass of the i-th candy. If number t_i 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

5 3
0 2 4
1 3 1
0 8 3
0 20 10
1 5 5

Output

4

贪心题，题水，最近脑子不好使，跪了无数次

AC代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define M 100005
#define ll long long
using namespace std;

struct H
{
   int t,h,m;
}a[M],b[M];

bool cmp(H a,H b)
{
    return a.m>b.m;
}

int main()
{
    int n,x,c,sum=0,s=0;
    int i,j,l;
    scanf("%d%d",&n,&c);
    for(i=1;i<=n;i++)
    {
        scanf("%d%d%d",&a[i].t,&a[i].h,&a[i].m);
        b[i].t=a[i].t;
        b[i].h=a[i].h;
        b[i].m=a[i].m;
    }
    sort(a+1,a+n+1,cmp);
    sort(b+1,b+n+1,cmp);//贪性价高的
    x=c;l=0;
    for(i=1;i<=n;i++)
    {
        if(a[i].t==l&&x>=a[i].h)
        {
            x+=a[i].m;
            sum++;
            a[i].t=-1;
            l=1-l;//类型转换
            i=0;//不断重来搜最好的
        }
    }
    x=c;l=1;//两种情况枚举
    for(i=1;i<=n;i++)
    {
        if(b[i].t==l&&x>=b[i].h)
        {
            x+=b[i].m;
            s++;
            b[i].t=-1;
            l=1-l;
            i=0;
        }
    }
    if(s>sum)
        sum=s;
    printf("%d\n",sum);
    return 0;
}