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
return item1.limit-item1.weight < item2.limit-item2.weight ;
根据区间大小从小到大排序(范围小的值可以覆盖dp[ ]的范围更大,之后可以更大选择其他)
#include <stdio.h>
#include <algorithm>
#include<string.h>
#include<iostream>
using namespace std; //crucial
#define N 500
#define M 5000
typedef struct
{
int weight;
int limit;
int value;
}node; //store items
int f[M + 5]; //the kernel array
bool compare(node item1, node item2) //for using the sort function
{
return item1.limit-item1.weight < item2.limit-item2.weight ;
}
int main()
{
int n, m, i, j;
while (scanf("%d %d", &n, &m) != EOF)
{
//input
memset(f,0,sizeof(f));
node items[N + 5];
for (i = 1; i <= n; i++)
scanf("%d %d %d", &items[i].weight, &items[i].limit, &items[i].value);
//have to sort in order to get the correct order
sort(items + 1, items + n + 1, compare);
//everytime initializing
//for (i = 1; i <= n; i++)//01背包问题
// cout<<items[i].weight<<" "<<items[i].limit<<" "<<items[i].value<<endl;
// 0/1 knapsack algorithm
for (i = 1; i <= n; i++)//01背包问题
{
for (j = m; j >= items[i].weight; j--)
{
if( j >= items[i].limit )
f[j] = max(f[j] , f[j - items[i].weight] + items[i].value);
}
}
printf("%d\n", f[m]);
}
return 0;
}