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
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
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.
2 10 10 15 10 5 10 5 3 10 5 10 5 3 5 6 2 7 3
5 11
嗯 这题是01背包加上sort排序 我也是看别人的博客的后来慢慢理解的
推荐blog http://www.mamicode.com/info-detail-1009053.html 帮助理解
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int dp[5005];
struct node
{
int cost;
int comp;
int val;
int level;
}thing[5005];
bool cmp(node a,node b)
{
return a.level<b.level;
}
// 排序是从小到大的 表示嗯 comp-cost的要尽量小
// 这样子会比较不浪费接下来要排的空间?
int main()
{
int n,m;
int cost,comp,val;
int i ,j;
while(scanf("%d%d",&n,&m)!=EOF)
{
memset(dp,0,sizeof(dp));
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&thing[i].cost,&thing[i].comp,&thing[i].val);
thing[i].level=thing[i].comp-thing[i].cost;
}
sort(thing+1,thing+1+n,cmp);
for(i=1;i<=n;i++)
{
for(j=m;j>=thing[i].comp;j--)
{
dp[j]=max(dp[j],dp[j-thing[i].cost]+thing[i].val);
}
}
printf("%d\n",dp[m]);
}
return 0;
}