HDU 3466 Proud Merchants
来源:互联网 发布:如何在网络上找外教 编辑:程序博客网 时间:2024/05/17 22:41
Proud Merchants
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 4334 Accepted Submission(s): 1788
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
Author
iSea @ WHU
Source
2010 ACM-ICPC Multi-University Training Contest(3)——Host by WHU
Recommend
zhouzeyong | We have carefully selected several similar problems for you: 3460 3463 3468 3467 3465
这道需要排序,不过刚开始做时虽然知道要排序,不过在排序时把按什么样的顺序排搞错了
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct node{int p,q,v;}t[11000];bool cmp(node a,node b){return a.q-a.p<b.q-b.p;//相差最小时才是最优 }int main(){int n,m,i,j,ans[11000];while(scanf("%d%d",&n,&m)!=EOF){for(i=1;i<=n;i++)scanf("%d%d%d",&t[i].p,&t[i].q,&t[i].v);sort(t+1,t+n+1,cmp);memset(ans,0,sizeof(ans));for(i=1;i<=n;i++)for(j=m;j>=t[i].q;j--)ans[j]=max(ans[j],ans[j-t[i].p]+t[i].v);printf("%d\n",ans[m]);}return 0; }
0 0
- hdu 3466 Proud Merchants
- HDU 3466 Proud Merchants
- hdu 3466 Proud Merchants
- hdu 3466 Proud Merchants
- hdu 3466 Proud Merchants
- HDU-3466-Proud Merchants
- HDU 3466 Proud Merchants
- hdu 3466 Proud Merchants
- HDU 3466 Proud Merchants
- HDU 3466 Proud Merchants
- hdu 3466 Proud Merchants
- HDU 3466 Proud Merchants
- HDU 3466 Proud Merchants
- HDU - 3466 Proud Merchants
- hdu 3466 Proud Merchants
- hdu 3466 Proud Merchants
- hdu 3466 Proud Merchants
- HDU 3466 Proud Merchants
- Eclipse-JEE解决Cannot change version of project facet Dynamic web module to 2.4
- 检测数据库大小的sql
- VC包含目录、附加依赖项、库目录及具体设置
- 项目适配iOS9遇到的一些问题及解决办法(更新两个小问题)
- FreeRTOS内存管理
- HDU 3466 Proud Merchants
- html 虚线
- Asp.Net4.5 mvc4 页面创建与讲解
- 【三层】VB.net版登录实例
- 在python中获取当前日期字符串(格式:X年X月X日)
- 欧拉项目第22题 Names scores
- acm-杭电-5645
- hive 0.8.1版本获取建表语句方法
- C#POST下载文件服务器返回500错误