A1068 Find More Coins(01背包)

原题：https://pintia.cn/problem-sets/994805342720868352/problems/994805402305150976
首先，这道题思路很奇特，w[]和c[]是相同的，我在这里使用coin[]代替。
然后，最后结果怎么都不对，我找了好久都没有找到问题，后来发现是输出的部分，找答案的方法不对，但是我看了很久都没有发现问题（见我的最后注释部分）。

#include <iostream>
#include <string>
#include <set>
#include <map>
#include<queue>
#include<stack>
#include<algorithm>
#include<stdio.h>

//new and delete
//A1068 Find More Coins
using namespace std;

const int MaxN = 10010;
const int MaxV = 101;
const int Inf = 0x3fffffff;

void PrintM(int a[],int M) {
	cout <<"数组："<< endl;
	for (int i = 0; i <= M; i++) {
		
		cout << a[i] << " ";
	}
	cout << endl;
}
void PrintF(bool a[][MaxV], int M, int N) {
	cout << "布尔数组：" << endl;
	for (int i = 0; i <= M; i++) {

		for (int j = 0; j <= N; j++) {
			
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;
}

//这里价值和重量相等，c[i]==w[i]
int coin[MaxN] = { 0 };
int M, V;	//M: the total number of coins, V:the amount of money Eva has to pay

int dp[MaxV] = { 0 };		//动态规划
bool choose[MaxN][MaxV] = { false };	//每一列是每种方案选不选，如果是完全背包就把bool改成int, 然后每选一次加一。

bool cmp(int a, int b) {
	return a > b;
}
void dynamic() {
	//边界条件已经预置

	//dp[v]=max{ dp[[v], dp[v-coin[i]]+coin[i] }
	for (int i = 1; i <= M; i++) {
		for (int v = V; v >= coin[i]; v--) {
			if (dp[v] <= dp[v - coin[i]] + coin[i]) {//不选i
				dp[v] = dp[v - coin[i]] + coin[i];
				choose[i][v] = true;
			}
			
		}
		//PrintM(dp, V);
		//PrintF(choose, M, V);
	}
}
int main() {
	cin >> M >> V;
	//这里注意coin从1开始编号
	for (int i = 1; i <= M; i++)
		cin >> coin[i];
	//首先排序
	sort(coin+1, coin + M+1,cmp);
	//动态规划
	dynamic();

	
	if (dp[V] != V)
		cout << "No Solution\n";
	else {	//找到序列
		bool flag[MaxN];
		int k = M, num = 0, v = V;
		while (k >= 0) {
			if (choose[k][v] == true) {
				flag[k] = true;
				v -= coin[k];
				num++;
			}
			else {
				flag[k] = false;
			}
			k--;
		}
		for (int i = M; i >= 1; i--) {
			if (flag[i] == true) {
				cout << coin[i];
				num--;
				if (num > 0)
					cout << " ";
			}
			
		}

		/*这种输出方法有问题
		vector<int> ans;
		int v_temp = V;
		int i = M;
		while (v_temp != 0) {
			if (choose[i][v_temp] == true) {
				ans.push_back(coin[i]);
				v_temp -= coin[i];
				i--;
			}
			else {
				i--;
			}
		}*/
/*
		for (int i = 0; i < ans.size(); i++)
		{
			cout << ans[i];
			if (i < ans.size() - 1)
				cout << " ";
			else
				cout << endl;
		}*/
	}
	return 0;
}