【HDU - 3466 】Proud Merchants（dp，背包问题，巧妙排序）

题干：

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

Sample Output

5
11

题目大意：

给你一些钱 m ，然后在这个国家买东西，共有 n 件物品，每件物品有价格 P 价值 V 还有一个很特别的属性 Q, Q 指你如过想买这件物品你的手中至少有这钱Q 。虽然你只要花费钱P ，但你的手中至少有钱Q，如果不足Q ，不能买。问给你钱M ，列出N件物品，最多能获得多少价值的东西。。。。

解题报告：

先排序，然后跑一边0-1背包即可。这个排序很巧妙啊

AC代码：

#include<bits/stdc++.h>
using namespace std;
struct Node {int p,q,v;
} node[500 + 5];
int dp[5000 + 5];
bool cmp(const Node & a,const Node & b) {return a.q-a.p<b.q-b.p;//b.q+a.p>b.p+a.q
}
int main()
{int n,m;while(cin>>n>>m) {for(int i = 1; i<=n; i++) {scanf("%d%d%d",&node[i].p,&node[i].q,&node[i].v);}memset(dp,0,sizeof(dp));sort(node+1,node+n+1,cmp);for(int i = 1; i<=n; i++) {for(int j = m;j >=max(node[i].q,node[i].p); j--) {dp[j] = max(dp[j],dp[j-node[i].p ] + node[i].v);}}printf("%d\n",dp[m]);}return 0;
}

【HDU - 3466 】Proud Merchants（dp，背包问题，巧妙排序）相关推荐

01背包入门：HDU 3466 Proud Merchants
这道题对我来说还是有点难度的,所以参考了两个博主的博客:博主1博主2 Problem Description Recently, iSea went to an ancient country. Fo ...
POJ 1417 True Liars(路径压缩并查集+DP背包问题)
POJ 1417 True Liars(路径压缩并查集+DP背包问题) http://poj.org/problem?id=1417 题意: 给出p1+p2个人,其中p1个是好人,p2个是坏人.然后有 ...
【HDU 3466】【Proud Merchants】
题目: Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and pow ...
hdu 3466（dp）
讲解博客针对单个物品好理解贪心策略,两个物品相对比的思路不易理解. #include<cstdio> #include<iostream> #include<cstri ...
HDU3466 Proud Merchants
题目描述: Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and p ...
HDU - 3466（01背包理解）
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3466 题意:给你一些钱 m ,然后在这个国家买东西, 共有 n 件物品,每件物品价格P价值V还有一个很 ...
HDU 1114 Piggy-Bank 简单DP
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1114 题目大意:完全背包问题,不过这次是求的最小值. 解题思路:首先是初始化问题,其次就是状态转移的时 ...
HDU 1574 RP问题(DP)
题目链接 :HDU 1574 RP问题 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Othe ...
HDU 2196 Computer 树形DP经典题
链接:http://acm.hdu.edu.cn/showproblem.php? pid=2196 题意:每一个电脑都用线连接到了还有一台电脑,连接用的线有一定的长度,最后把全部电脑连成了一棵树,问 ...

【HDU - 3466 】Proud Merchants（dp，背包问题，巧妙排序）

【HDU - 3466 】Proud Merchants（dp，背包问题，巧妙排序）相关推荐

最新文章

热门文章