【PAT】A1068 Find More Coins【0-1背包】

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However, there was a special requirement of the payment: for each bill, she must pay the exact amount. Since she has as many as 10^​4​​ coins with her, she definitely needs your help. You are supposed to tell her, for any given amount of money, whether or not she can find some coins to pay for it.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: N (≤10^​4​​ , the total number of coins) and M (≤10^2​​ , the amount of money Eva has to pay). The second line contains N face values of the coins, which are all positive numbers. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the face values V​1​​ ≤V​2​​ ≤⋯≤V​k such that V​1​​ +V​2​​ +⋯+V​k
​​ =M. All the numbers must be separated by a space, and there must be no extra space at the end of the line. If such a solution is not unique, output the smallest sequence. If there is no solution, output “No Solution” instead.

Note: sequence {A[1], A[2], …} is said to be “smaller” than sequence {B[1], B[2], …} if there exists k≥1 such that A[i]=B[i] for all i<k, and A[k] < B[k].

Sample Input 1:

8 9
5 9 8 7 2 3 4 1

Sample Output 1:

1 3 5

Sample Input 2:

4 8
7 2 4 3

Sample Output 2:

No Solution

题意

给出N个硬币，求组成价值为M的序列，如果有多个答案，求字典序最小的那一个。

思路

将其看做价值和质量等同的0-1背包问题，将硬币从大到小排序后，依次考虑是否放入第i个硬币，dp[v]表示空间为v时最大的价值。c[i][v]表示达到价值v时是否放入第i个硬币。遍历完成后如果dp[M]!=M即没有一个序列能达到M，否则逆向查找出路径（题目要求输出字典序小的）。

代码

#include <cstdio>
#include <algorithm>
#include <functional>// 包含greater<int>()
#