HDU3466 Proud Merchants

题目描述：

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?

输入描述：

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.

输出描述：

For each test case, output one integer, indicating maximum value iSea could get.

题意：

有n个商人，每个商人都很自负，如果你的钱数少于Qi，那么就不与你交易

思路：

这题交易的顺序会影响答案，比如

5 10 5

3 5 6

如果先去第一个再去第二个可以获得11

但是先去第二个再去第一个就只能获得6

先买i后买j

M >= Qi, M - Pi >= Qj

买j后不能买i

M >= Qj, M - Pj < Qi

推导：

Pi - M <= -Qj

M - Pj < Qi

Pi - Pj < Qi - Qj

Pi - Qi < Pj - Qj

Qi - Pi > Qj - Pj

如果满足Qi - Pi > Qj - Pj那么就说明i 不能先j

排序后背包即可

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
ll dp[5005];
struct node{
	int p, q, v;
}arr[505];
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 = 1; i <= n; i++){
			cin >> arr[i].p >> arr[i].q >> arr[i].v;
		}
		sort(arr + 1, arr + 1 + n, cmp);
		for(int j = 0; j <= m; j++){
			dp[j] = 0;
		}
		for(int i = 1; i <= n; i++){
			for(int j = m; j >= arr[i].q; j--){
				dp[j] = max(dp[j], dp[j - arr[i].p] + arr[i].v);
			}
		}
		cout << dp[m] << endl;
	}
	return 0;
}