L - Space Elevator

                                                               Space Elevator

The cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to build the tower. Each block of type i has height h_i (1 <= h_i <= 100) and is available in quantity c_i (1 <= c_i <= 10). Due to possible damage caused by cosmic rays, no part of a block of type i can exceed a maximum altitude a_i (1 <= a_i <= 40000).

Help the cows build the tallest space elevator possible by stacking blocks on top of each other according to the rules.

Input

* Line 1: A single integer, K

* Lines 2..K+1: Each line contains three space-separated integers: h_i, a_i, and c_i. Line i+1 describes block type i.

Output

* Line 1: A single integer H, the maximum height of a tower that can be built

Sample Input

3
7 40 3
5 23 8
2 52 6

Sample Output

48

Hint

OUTPUT DETAILS:

From the bottom: 3 blocks of type 2, below 3 of type 1, below 6 of type 3. Stacking 4 blocks of type 2 and 3 of type 1 is not legal, since the top of the last type 1 block would exceed height 40.

代码：

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

int dp[40005];  //d[i]表示石块能组成的高度为i

struct node
{
    int h;
    int a;
    int c;
}s[405];

int cmp(node x,node y)
{
    return x.a<y.a;
}

int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>s[i].h>>s[i].a>>s[i].c;
    sort(s,s+n,cmp);
    memset(dp,-1,sizeof(dp));
    dp[0]=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<=s[i].a;j++)
        {
            if(dp[j]>=0)
                dp[j]=s[i].c;  //组成塔高j后，还有s[i].c个块可用
            else if(j<s[i].h || dp[j-s[i].h]<=0)
                dp[j]=-1;  //塔高<块高 || 块高无法组成的塔高
            else
                dp[j]=dp[j-s[i].h]-1;  //组成塔高j后，还有s[i].c--个块可用
        }
    }
    for(int i=s[n-1].a;i>=0;i--)
    {
        if(dp[i]>=0)
        {
            cout<<i<<endl;
            break;
        }
    }
    return 0;
}