hud oj 3466 Proud Merchants(0 1背包+贪心)

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.
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.
If he had M units of money, what’s the maximum value iSea could get?

 

Input

There are several test cases in the input.

Each test case begin with two integers N, M (1 ≤ N ≤ 500, 1 ≤ M ≤ 5000), indicating the items’ number and the initial money.
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.

The input terminates by end of file marker.

 

Output

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

 

Sample Input

2 1010 15 105 10 53 105 10 53 5 62 7 3

 

Sample Output

511

 

01 背包的题，比较灵活，只要稍微变化，我就不知道该怎么弄，认真思考，深入思考

#include<cstdio>#include<cstring>#include<stdlib.h>#include<ctype.h>#include<math.h>#include<stack>#include<queue>#include<map>#include<set>#include<vector>#include<string>#include<iostream>#include<algorithm>#include<utility>#include<iomanip>#include<time.h>#include<iostream>using namespace std;typedef long long ll;const double Pi = acos(-1.0);const int N = 1e6+10, M = 1e3+20, mod = 1e9+7, inf = 2e9+10;const double e=2.718281828459 ;const double esp=1e-9;int n,m;struct node{    int p,q,v;    int cha;} a[505];bool cmp(node x,node y){    return x.cha<y.cha;} int dp[5055]= {0};int main(){    while(~scanf("%d%d",&n,&m))    {        memset(dp,0,sizeof(dp));        for(int i=0; i<n; i++)        {            scanf("%d%d%d",&a[i].p,&a[i].q,&a[i].v);            a[i].cha=a[i].q-a[i].p;        }        sort(a,a+n,cmp);        for(int i=0; i<n; i++)        {            for(int j=m; j>=a[i].q; j--)            {                dp[j]=max(dp[j],dp[j-a[i].p]+a[i].v);            }        }        printf("%d\n",dp[m]);    }    return 0;}