HDU 3466 Proud Merchants

tanjunming2020

已于 2022-09-05 16:30:24 修改

阅读量811

点赞数 4

分类专栏：题解文章标签： c++

于 2022-09-02 19:14:36 首次发布

本文链接：https://blog.csdn.net/tanjunming2020/article/details/126669106

版权

题解专栏收录该内容

348 篇文章 0 订阅

订阅专栏

HDU 3466 Proud Merchants

Problem

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

Sample Output

5
11

题解

题目大意就是给出N个物品和M个单位的钱，第 $i$ 件物品价格为 $P_i$ ，价值为 $V_i$ ，只有你手中的钱大于等于 $Q_i$ 才能购买第 $i$ 件物品。求能买到的物品的价值的最大值为多少。多组数据。

很明显使用01背包。但是要做一些预处理。各个物品按 $Q_i-P_i)$ 从大到小排序，再做01背包。

为什么呢？假设需要购买物品 $i$ 和物品 $j$ ，如果先买 $i$ 再买 $j$ ，则至少需要 $max(Q_j+P_i,Q_i)$ 元，先买 $j$ 再买 $i$ ，则至少需要 $max(Q_i+P_j,Q_j)$ 元。同样买两种物品，最初的金额要求一定要最小才能最优。比较 $max(Q_j+P_i,Q_i)$ 和 $max(Q_i+P_j,Q_j)$ 。因为 $Q_i$ 和 $Q_j$ 在另一方中也出现过，所以可以省略，不影响大小的判断。所以我们只需要比较 $Q_j+P_i$ 和 $Q_i+P_j$ 。移项后就是 $Q_j-P_j$ 和 $Q_i-P_i$ ，也就是上面的式子。如果 $Q_i-P_i>Q_j-P_j$ ，则先选 $i$ 后选 $j$ 更优。所以我们要先选 $Q_i-P_i$ 大的物品。

code

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int n,m,ans,f[5005];
struct node{
    int p,q,k;
}v[505];
bool cmp(node ax,node bx){
    return ax.q-ax.p>bx.q-bx.p;
}
int max(int a,int b){
    return a>b?a:b;
}
int main()
{
    while(scanf("%d%d",&n,&m)!=EOF){
        for(int i=1;i<=n;i++){
            scanf("%d%d%d",&v[i].p,&v[i].q,&v[i].k);
        }
        sort(v+1,v+n+1,cmp);
        for(int i=0;i<m;i++) f[i]=-2147483647;
        f[m]=0;
        for(int i=1;i<=n;i++){
            for(int j=v[i].q-v[i].p;j<=m-v[i].p;j++){
                f[j]=max(f[j],f[j+v[i].p]+v[i].k);
            }
        }
        ans=0;
        for(int i=0;i<=m;i++){
            ans=max(ans,f[i]);
        }
        printf("%d\n",ans);
    }
    return 0;
}