练习三 Problem X

Problem Description

Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in this country are still very proud even if their nation hasn’t been so wealthy any more.<br>The merchants were the most typical, each of them only sold exactly one item, the price was Pi, but they would refuse to make a trade with you if your money were less than Qi, and iSea evaluated every item a value Vi.<br>If he had M units of money, what’s the maximum value iSea could get?<br><br>

Input

There are several test cases in the input.<br><br>Each test case begin with two integers N, M (1 ≤ N ≤ 500, 1 ≤ M ≤ 5000), indicating the items’ number and the initial money.<br>Then N lines follow, each line contains three numbers Pi, Qi and Vi (1 ≤ Pi ≤ Qi ≤ 100, 1 ≤ Vi ≤ 1000), their meaning is in the description.<br><br>The input terminates by end of file marker.<br><br>

Output

For each test case, output one integer, indicating maximum value iSea could get.<br><br>

Sample Input

   
   

    
    2 10
10 15 10
5 10 5
3 10
5 10 5
3 5 6
2 7 3
   
   

Sample Output

   
   

    
    5
11

   
   

题意：首先给出物品数量和手中资金之后每样物品给出价格，需要购买时手中至少需要的资金，以及物品本身的价值，求最大资金是多少。

思路：01背包，先按q-p排保证差额最小（最优），dp方程：dp[j]=max(dp[j],dp[j-node[i].p]+node[i].v);

感想：算是参考了网上的答案吧，不高兴 = =

代码：

<span style="font-size:14px;color:#6600cc;background-color: rgb(255, 255, 255);">#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int MAXN=550;
struct Node
{
    int p,q,v;
}node[MAXN];
int dp[5500];
bool cmp(Node a,Node b)
{
    return a.q-a.p<b.q-b.p;
}
int main()
{
    int n,m,i,j;
    while(cin>>n>>m)
    {
        for(int i=0;i<n;i++)
          scanf("%d%d%d",&node[i].p,&node[i].q,&node[i].v);
        sort(node,node+n,cmp);
        memset(dp,0,sizeof(dp));
        for(i=0;i<n;i++)
          for(j=m;j>=node[i].q;j--)
            dp[j]=max(dp[j],dp[j-node[i].p]+node[i].v);
        printf("%d\n",dp[m]);
    }
    return 0;
}</span>