【HDU3466】Proud Merchants(01背包)
来源:互联网 发布:手机天网视频软件 编辑:程序博客网 时间:2024/05/24 06:33
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 10
10 15 10
5 10 5
3 10
5 10 5
3 5 6
2 7 3
Sample Output
5
11
此题要把价值与最低要求值得差值进行排序;
#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int maxn = 5000+5;int dp[maxn];struct FYJ{ int p; int q; int v;}fyj[maxn];int cmp( FYJ a, FYJ b ){ return a.q-a.p<b.q-b.p;}int main(){ int n,m; while( ~scanf("%d%d",&n,&m) ) { memset(dp,0,sizeof(dp)); for( int i=1 ; i<=n ; i++ ) { scanf("%d%d%d",&fyj[i].p,&fyj[i].q,&fyj[i].v); } sort( fyj+1,fyj+1+n,cmp ); for( int i=1 ; i<=n ; i++ ) for( int j=m ; j>=fyj[i].q ; j-- ) { dp[j] = max( dp[j],dp[j-fyj[i].p]+fyj[i].v ); } printf("%d\n",dp[m]); } return 0;}
- HDU3466:Proud Merchants(01背包)
- hdu3466 Proud Merchants (01背包)
- 【HDU3466】Proud Merchants(01背包)
- hdu3466 Proud Merchants 01背包 排序 dp
- hdu3466 Proud Merchants(排序+01背包)
- hdu3466 Proud Merchants 变形01背包
- HDU3466 - Proud Merchants(贪心+01背包)
- HDU3466 Proud Merchants(贪心+01背包)
- HDU3466~Proud Merchants(01背包+贪心)
- HDU3466 Proud Merchants (01背包变形)
- HDU3466 Proud Merchants 排序01背包
- HDU3466 Proud Merchants(背包)
- 01背包水题篇之HDU3466——Proud Merchants
- hdu3466 Proud Merchants 需要排序的01背包
- hdu3466-Proud Merchants 0-1背包
- hdu3466 Proud Merchants 0-1背包变形
- Proud Merchants 。。。01背包
- hdu3466 Proud Merchants
- 网易实习招聘,求一个字符串的所有子回文字符串
- leetcode——290——Word Pattern
- OSI七层模型的每一层都有哪些协议
- BZOJ3589: 动态树
- Java初学者需掌握的30个基本概念
- 【HDU3466】Proud Merchants(01背包)
- Problem-1017
- Better History(历史记录)
- [R语言] quantmod 包获取国内的股票数据
- GNU开发笔记--开发环境基础(持续更新)
- Jsp
- java:double四舍五入并保留两位小数的方法
- 商业即生活,一些思考和感悟
- Problem-1016