【杭电3466】贪心+背包
来源:互联网 发布:最新中英文翻译软件 编辑:程序博客网 时间:2024/06/05 07:34
Proud Merchants
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uAppoint description:
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
n个商人,每个商人有一个物品,物品有价格w、价值v还有一个交易限制p。p的意义是假如你现在拥有的钱数小于p,那么是不允许交易的。
w是交换时需要给对方的钱,v是评估价值,即自己获得的钱,p是限制条件
因为有条件限制,按背包算之前先排序,贪心选取q小p大的,q-p差值从小到大排序,具体原因不知道-_-|||
1234567891011121314151617181920212223242526272829303132#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int dp[5505];struct node{int w,p,v;}a[505];bool cmp(node x,node y){return x.p-x.w<y.p-y.w;}int main(){int n,m;while(~scanf("%d%d",&n,&m)){memset(dp,0,sizeof(dp));for(int i=0;i<n;i++)scanf("%d%d%d",&a[i].w,&a[i].p,&a[i].v);sort(a,a+n,cmp);for(int i=0;i<n;i++){for(int j=m;j>=a[i].p;j--){dp[j]=max(dp[j],dp[j-a[i].w]+a[i].v);}}printf("%d\n",dp[m]);}return 0;}
0 0
- 【杭电3466】贪心+背包
- 杭电 2111 Saving HDU 贪心算法 背包问题
- 杭电3466 0-1背包
- 杭电2189贪心
- 杭电1248-背包
- 杭电1051 经典贪心
- 杭电ACM_1009贪心法
- 杭电ACM1203(贪心法)
- 贪心算法-杭电oj2037
- 杭电2602 贪心算法
- 杭电 2037 经典贪心
- 杭电 hdu 2037 贪心
- 杭电 2602 01 背包
- 杭电2159背包问题!
- 杭电1712--分组背包。。
- 杭电1494---01背包。
- 杭电1114 完全背包
- 杭电2602---01背包
- c语言算术运算表达式与赋值运算表达式的类型转换规则
- thinkphp 模糊查询组合
- 静态变量和非静态变量
- 两张图让你理解socket的TCP/UDP
- FreeCMS视频教程 将FreeCMS导入myeclipse
- 【杭电3466】贪心+背包
- Codeforces Beta Round #17D. Notepad
- 傀儡进程原理及调试
- 268. Missing Number
- Python Flask 初探
- 哈夫曼编码
- 题目一:n个人叫m次.第m个人淘汰,重新开始,一直到最后一个人的问题(java)
- JZOJ 4679 种树【NOIP2016提高A组8.11】
- idea 加载不到 artifact