L3-001 凑零钱 (30分) CCCC团体程序设计大赛 （01背包+输出最小字典序方案）

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e4 + 4;
const int MAXW = 2e2 + 2;
int w[MAXN];
int dp[MAXW];
int path[MAXN][MAXW];
int main()
{
	int n, W;
	scanf("%d%d", &n, &W);
	for (int i = 1; i <= n; i++)scanf("%d", &w[i]);
	sort(w + 1, w + 1 + n, greater<int>());
	fill(dp, dp + MAXW, -1);
	dp[0] = 0;
	for (int i = 1; i <= n; i++)
	{
		for (int j = W; j - w[i] >= 0; j--) {
			if (dp[j - w[i]] == -1)continue;
			if (dp[j] <= dp[j - w[i]] + 1) {
				dp[j] = dp[j - w[i]] + 1;
				path[i][j] = 1;
			}
		}
	}
	if (~dp[W]) {
		for (int i = n, j = W; i >= 1 && j > 0; i--) {
			if (path[i][j]) {
				printf("%d", w[i]);
				j -= w[i];
				if (j)putchar(' ');
			}
		}
	}
	else puts("No Solution");
	return 0;
}