codeforces A. Feed with Candy

Feed with Candy

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

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 thei-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 Input

Input

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

Output

4

Hint

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:

1. 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.
2. 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.
3. 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.
4. Om Nom eats candy 2, the height of his jump is 15 + 1 = 16. He cannot reach candy 4.

题目意思：给出 n 颗只有两种类型：fruit 和 caramel的candies，这些candies是挂在屋子上的，对于第 i 颗candy，它离地面为 hi 厘米，质量为 mi；有只叫Om Nom的怪兽想尽可能地把这些candy吃光，它初始的时候只能跳 x 的高度，如果有某颗或者一些candy离地面的距离 <= x，就代表Om Nom可以吃掉，吃掉之后它下一次可以跳的高度会变成 x + mi（mi代表某颗低于 x 厘米的candy 的质量），也就是增加 mi。

智商太捉急了。。。。

分类讨论先吃哪种水果

#include <iostream>
#include <math.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int Max=2010;
int n,H;
struct node
{
    int NO;
    int h;
    int m;
};
node d[Max];
int cmp(node a,node b)
{
    if(a.m!=b.m)
    {
        return a.m>b.m;
    }
    return a.h<b.h;
}
int sove(int flag)
{
    int j,cnt=0;
    int vis[Max];
    int num=H;
    memset(vis, false, sizeof(vis));
    for (int i=0; i<n; i++)
    {
        for (j=0; j<n; j++)
        {
            if(!vis[j] && num>=d[j].h && d[j].NO==flag)
            {
                num+=d[j].m;
                vis[j]=true;
                flag=1-flag;   //换着水果种类吃
                cnt++;
                break;
            }
        }
        if(j==n)   //莫法再吃了
        {
            break;
        }
    }
    return cnt;
}
int main()
{
    int ans;
    while (cin>>n>>H)
    {
        ans=0;
        for (int i=0; i<n; i++)
        {
            cin>>d[i].NO>>d[i].h>>d[i].m;
        }
        sort(d, d+n, cmp);
        ans=max(sove(0),sove(1));
        cout<<ans<<endl;
    }
    return 0;
}