1068. Find More Coins (30)

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
struct coins {
int value;
bool visited;
coins(int _value = 0, bool _visited = false) :value(_value), visited(_visited) {};
};
using namespace std;
vector<coins>  coin;
bool setted = false;
void Read(int totalnum);
bool cmp(const coins &a, const coins &b) {
return a.value < b.value;
}
vector<int>output, current;
void dfs(int index, int currentsum, int sum);
int main() {
freopen("D://input.txt", "r", stdin);
int totalnum, pay, i;
cin >> totalnum >> pay;
Read(totalnum);
sort(coin.begin(), coin.end(), cmp);
dfs(0, 0, pay);
if (output.size()) {
cout << output[0];
for (i = 1; i < output.size(); i++) {
cout << " " << output[i];
}
cout << endl;
}
else
cout << "No Solution" << endl;
return 0;
}
void Read(int totalnum) {
int i, _value;
coins temp;
coin.resize(totalnum);
for (i = 0; i < totalnum; i++) {
cin >> _value;
coin[i].value = _value;
}
return ;
}
void dfs(int indexm, int currentsum, int sum) {
int i;
if (!setted) {
if (currentsum > sum)
return;
else if (currentsum == sum) {
if (output.size() == 0) {
output = current;
setted = true;
}
return;
}
for (i = 0; i < coin.size(); i++) {
if (!coin[i].visited) {
currentsum += coin[i].value;
coin[i].visited = true;
current.push_back(coin[i].value);
dfs(i, currentsum, sum);
current.pop_back();
coin[i].visited = false;
currentsum -= coin[i].value;
}
}
}
return;

}

将输入硬币排序，深度搜索找到的第一个序列一定是最小序列，所以设置全局bool量setted，标志是否完成查找，然而依然有一个case过不去……