hduoj 3466 Proud Merchants（背包）

Proud Merchants

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)

Total Submission(s): 5406    Accepted Submission(s): 2274

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

题目地址：hduoj 3466

思路：1：大神博客（关键是把q-p按从小到大排序，代码绝对原版。）

            2：第一次超时了，后来把cmp函数改为下面的代码就AC了，55555555，小伙伴们，你们记住了吗？？

               bool operator < (const node b)const {                      return q-p<b.q-b.p;

#include<cstdio>#include<string.h>#include<algorithm>using namespace std;struct node{int p, q, v;bool operator < (const node b)const {    return q-p<b.q-b.p; }}x[505];int main(){int n, m, f[5005];    while(scanf("%d %d", &n, &m)!=EOF)    {    int i, j;    for(i = 0; i < n; i++)        scanf("%d %d %d", &x[i].p, &x[i].q, &x[i].v);    sort(x, x+n);    memset(f, 0, sizeof(f));        for(i  = 0; i < n; i++){for(j = m; j >= x[i].q ; j--){f[j] = max(f[j], f[j-x[i].p]+x[i].v);}}        printf("%d\n", f[m]);        }return 0;}

Sample Output

511