hdu 3466 Proud Merchants
来源:互联网 发布:php单例模式代码 编辑:程序博客网 时间:2024/04/30 11:06
Proud Merchants
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 3918 Accepted Submission(s): 1639
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贪心过程:
假设A,B两个物品,要使得先后顺序让所需空间最小,才能让后面的价值可能越大假如A先放,则需要空间 q1+p2;B先放,则所需空间为 q2+p1;假如要让A排在前面,则排序方式为 q1+p2<q2+p1
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;struct Node{int p,q,v;}node[510];int cmp(Node a,Node b){return a.q-a.p<b.q-b.p;}int main(){int m,n;while(scanf("%d%d",&n,&m)!=EOF){int i,j;for(i=0;i<n;i++) { int p,q,v; scanf("%d%d%d",&p,&q,&v); Node N={p,q,v}; node[i]=N; }sort(node,node+n,cmp);int dp[5010];memset(dp,0,sizeof(dp));for(i=0;i<n;i++) for(j=m;j>=node[i].q;j--) dp[j]=max(dp[j],dp[j-node[i].p]+node[i].v);printf("%d\n",dp[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
- objective - C 下字符串的处理方法
- Linux压缩解压缩文章总结
- codeforces 412A Poster
- nyoj 诡异的电梯【Ⅰ】 1070 (DP) 好题
- 编译原理与技术(第四章)语法分析
- hdu 3466 Proud Merchants
- 拉丁矩阵问题
- 关于CocoaPods的使用小说明
- Palindrome Number
- git命令行提交代码(因为某些原因Eclipse不能提交代码,所以改用git命令)
- hdoj3664Permutation Counting【递推】
- split 的 使用方法
- 数据库
- 1、OC 语言的基本特点 OC 语言是 C 语言的一个超集,只是在 C 的基础之上加上了面向对象(oo) 的特性; OC 与 Java 语言相同都是单继承,这一点与 C++语言不同(多重继承); OC