题目:https://pta.patest.cn/pta/test/16/exam/4/question/686
题意:有n个有面值的硬币,问能不能凑成m元,如果可以,则输出按硬币面值排序最小的方案
思路:01背包记录路径。可以把硬币从大到小排序,那么在01背包计算过程中,就可以从大更新到小,然后逆向寻找路径时输出即可
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <functional>
using namespace std;
const int N = 10010;
int arr[N];
int dp[N][110];
bool vis[N][110];
int main()
{
int n, m;
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++)
scanf("%d", arr + i);
memset(dp, 0, sizeof dp);
memset(vis, 0, sizeof vis);
sort(arr + 1, arr + 1 + n, greater<int>());
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
if(j < arr[i] || dp[i-1][j] > dp[i-1][j-arr[i]] + arr[i]) dp[i][j] = dp[i-1][j];
else
{
dp[i][j] = dp[i-1][j-arr[i]] + arr[i], vis[i][j] = true;
}
if(dp[n][m] != m)
printf("No Solution\n");
else
{
int res[N], k = 0;
while(m)
{
while(! vis[n][m])
n--;
res[k++] = arr[n];
m -= arr[n];
n--;
}
for(int i = 0; i < k; i++)
printf("%d%c", res[i], i == k - 1 ? '\n' : ' ');
}
return 0;
}