HDU3466 Proud Merchants
来源:互联网 发布:淘宝好还是京东商城好 编辑:程序博客网 时间:2024/05/28 15:10
Proud Merchants
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 2126 Accepted Submission(s): 843
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?
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.
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
#include<stdio.h>#include<algorithm>using namespace std;int dp[5000]={0};struct sa{ int p,q,v;}data[1005];int max(int a,int b){ return a>b?a:b;}int cmp(const sa &a,const sa &b){ return a.q-a.p<b.q-b.p;}int main(){ int n,m; while(scanf("%d%d",&n,&m)!=EOF) { int i,j; memset(dp,0,sizeof(dp)); for(i=1;i<=n;i++) scanf("%d%d%d",&data[i].p,&data[i].q,&data[i].v); sort(data+1,data+1+n,cmp); for(i=1;i<=n;i++) for(j=m;j>=data[i].q;j--) { dp[j]=max(dp[j],dp[j-data[i].p]+data[i].v); } printf("%d\n",dp[m]); } return 0;}
0 0
- hdu3466 Proud Merchants
- hdu3466-Proud Merchants
- hdu3466 Proud Merchants
- HDU3466 Proud Merchants
- hdu3466 Proud Merchants
- 【精华】【HDU3466】Proud Merchants
- HDU3466---Proud Merchants
- hdu3466 Proud Merchants
- 【HDU3466】【Proud Merchants】
- Hdu3466 Proud Merchants
- hdu3466-Proud Merchants
- Hdu3466 Proud Merchants
- 【HDU3466】Proud Merchants
- HDU3466 Proud Merchants
- hdu3466 Proud Merchants
- HDU3466 Proud Merchants
- hdu3466 Proud Merchants
- HDU3466:Proud Merchants(01背包)
- Socket编程简单实例
- ios知识点小结
- 12个有趣的C语言面试题
- wikioi2926 黑白瓷砖
- JMeter压力测试案例大全之(jmeter和数据库测试)
- HDU3466 Proud Merchants
- Eclipse批量修改xml文件中的包名
- Sqlserver中判断表是否存在
- UITableViewCell 嵌套 UIWebView,cell自适应高度
- vs2010常见的调试错误及使用技巧
- 锁存器和自旋锁(Latch&Spinlock)----理解Latch和Spinlock
- document.all.WebBrowser.ExecWB的完整说明
- dateformat后时间少了8小时问题
- 用js给div添加鼠标悬停事件