Proud Merchants
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 7916 Accepted Submission(s): 3317
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
假设有两个物品,他们分别为p1,q1,p2,q2,假设我们要先买第一个物品,则至少 需要q1+p2,买第二个物品的时候至少需要
q2+p1;而q1+p2<q2+p1,也就是q1-p1<q2-p2,因此我们要先买p和q差距小的,先排序然后直接01背包就可以了。
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
const int maxn = 100500;
struct node
{
int p,q,w;
} s[maxn];
int dp[maxn];
bool cmp(node a,node b){
return (a.q-a.p)<(b.q-b.p);
}
int main(){
int n,m;
while(cin>>n>>m){
for(int i=0;i<n;i++){
cin>>s[i].p>>s[i].q>>s[i].w;
}
sort(s,s+n,cmp);
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++){
for(int j=m;j>=s[i].q;j--){
dp[j]=max(dp[j],dp[j-s[i].p]+s[i].w);
}
}
cout<<dp[m]<<endl;
}
return 0;
}