题意：

给出

商品个数，拥有的金钱；

出售价格，最低金钱，实际价值；

求出能够获得的最大价值。

注意：

1）对Qi-Pi排序（差值）

java代码：

import java.util.Scanner;

public class Main {
	/*
	 * dp-表示背包数组，
	 */
	static int n, m, a, b, c;
	static int[] dp = new int[5001];
	static Node1171[] nodes = new Node1171[501];

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		for (int i = 0; i < nodes.length; i++) {
			nodes[i] = new Node1171();
		}
		while (sc.hasNext()) {
			n = sc.nextInt();
			m = sc.nextInt();
			for (int i = 1; i <= n; i++) {
				a = sc.nextInt();
				b = sc.nextInt();
				c = sc.nextInt();
				nodes[i].set(a, b, c);
			}
			for (int i = 0; i <= m; i++) {
				dp[i] = 0;
			}
			mySort();
			for (int i = 1; i <= n; i++) {
				/*
				 * m为最大的重量，
				 * dp数组保存价值。
				 */
				for (int j = m; j - nodes[i].q >= 0; j--) {
					dp[j] = max(dp[j], dp[j - nodes[i].p] + nodes[i].v);
				}
			}
			System.out.println(dp[m]);
		}
	}

	public static int max(int a, int b) {
		return a > b  a : b;
	}

	/*
	 * 采用普通排序
	 */
	public static void mySort() {
		Node1171 temp = null;
		for (int i = 1; i < n; i++) {
			for (int j = i + 1; j <= n; j++) {
				/*
				 * 差值最小的为最优
				 */
				if (nodes[i].q - nodes[i].p > nodes[j].q - nodes[j].p) {
					temp = nodes[i];
					nodes[i] = nodes[j];
					nodes[j] = temp;
				}
			}
		}
	}

}

class Node1171 {
	int p;
	int q;
	int v;

	public Node1171() {
	}

	public void set(int p, int q, int v) {
		this.p = p;
		this.q = q;
		this.v = v;
	}

}

Proud Merchants

2 10
10 15 10
5 10 5
3 10
5 10 5
3 5 6
2 7 3

5
11