HDU 3466 Proud Merchants【01dp】

原创 2016年08月31日 16:27:38

Proud Merchants

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 5497    Accepted Submission(s): 2318


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?

 

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
 

Author
iSea @ WHU
 


#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define MS(x,y)memset(x,y,sizeof(x))
typedef long long LL;
const int INF=0x7ffffff;

const int M=550;
int dp[5005];
int i,j,k,n,m;

struct Node
{
    int p,q,v;
}node[M];

bool cmp(Node a,Node b)
{
    return a.q-a.p<b.q-b.p;
}

int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        rep(i,0,n)
           scanf("%d%d%d",&node[i].p,&node[i].q,&node[i].v);
        sort(node,node+n,cmp);
        MS(dp,0);
        rep(i,0,n)
          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;
}


版权声明:噗噗个噗~~~

【并查集专题】【HDU】

How Many Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • zy691357966
  • zy691357966
  • 2014年11月29日 18:34
  • 1934

hdu5444 Elven Postman(二叉树遍历)

题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5444 题目大意:给出一颗二叉树的先序遍历,默认的中序遍历是1.、2、……n。给出q个询问,询...
  • aaaaacmer
  • aaaaacmer
  • 2015年09月14日 17:00
  • 1257

hdu 2023 求平均成绩

本题链接:点击打开链接 本题题意:         有n名学生,m门课程,输入每个学生没门课程的成绩,求每个学生的平均成绩和没门课程的平均成绩,并统计每门课程的成绩均超过该课程平均成绩的学生有多少...
  • LSGBB
  • LSGBB
  • 2015年08月10日 19:53
  • 1963

HDU 3466 Proud Merchants(DP:01背包+贪心)

HDU 3466 Proud Merchants(DP:01背包+贪心) 题意:同样有nKind个物品,每个物品有一个weighe[i]和value[i],但是如果你当前余额 分析:首先对于任意两...
  • u013480600
  • u013480600
  • 2014年04月02日 13:37
  • 632

HDU - 3466 Proud Merchants骄傲的商人(01背包变形)

Description Recently, iSea went to an ancient country. For such a long time, it was the most wealth...
  • linyuxilu
  • linyuxilu
  • 2016年08月02日 22:12
  • 215

【01背包】HDU3466Proud Merchants【判断顺序】

题目链接: Problem Description Recently, iSea went to an ancient country. For such a long time, i...
  • wlxsq
  • wlxsq
  • 2016年04月07日 12:39
  • 385

Proud Merchants HDU - 3466 (思路题--有排序的01背包)

Recently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerfu...
  • qq_35806592
  • qq_35806592
  • 2017年03月24日 20:07
  • 91

hdu 3466 Proud Merchants(01 背包)

Proud Merchants Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Sub...
  • acm_BaiHuzi
  • acm_BaiHuzi
  • 2014年10月24日 17:55
  • 591

hdu3466——Proud Merchants——————【01背包排序】

/**    解题思路:明显的01背包,但是这个有一个金额限制,所以不仅仅是01背包,因为转移方程应为    for(int k=0;k    for(int i=V;i>=items[k]...
  • u014696011
  • u014696011
  • 2015年01月28日 11:54
  • 499

HDU3466:Proud Merchants(01背包)

Problem Description Recently, iSea went to an ancient country. For such a long time, it was the mos...
  • libin56842
  • libin56842
  • 2013年06月06日 01:19
  • 2660
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 3466 Proud Merchants【01dp】
举报原因:
原因补充:

(最多只允许输入30个字)