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
这道题的限制条件是买一件东西看的不仅仅是这件东西的价格,还有你自己的钱数,如果小于它限制的钱数,就算你的钱够买这件商品也不卖。当然卖家给出的限定钱数肯定是大于这件商品的价格的。
题意就是先给你商品的种类和你拥有的钱数,然后给出每种商品的价格、限制的钱数和商品的价值。
求出你能买到的价值为多少。(每种商品只卖一次)
这个题排序的意义在于要先买限制钱数多的和价格低的(这两种同样重要,不能只看限定价格高的,万一它的价格很高,价值很低怎么办,所以排序的时候排的为限定钱数-价格,最低的靠前)。这样才能拥有尽可能多的选择。
#include<bits/stdc++.h>
using namespace std;
struct node
{
int p,q,v,c;
}s[5100];
int dp[5100];
int cmp(node a,node b)
{
return a.q-a.p<b.q-b.p;
}
int main()
{
int n,m;
while(cin>>n>>m)
{
memset(dp,0,sizeof(dp));
for(int i = 0;i<n;i++)
cin>>s[i].p>>s[i].q>>s[i].v;
sort(s,s+n,cmp);
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].v);
}
cout<<dp[m]<<endl;
}
return 0;
}