PAT甲级 1053（C++）

一次过！好耶！

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct node {
	int no;
	int weight;
};
int N, M, S;
vector<struct node>tree[101];
vector<int>path; int sum=0;
int w[101];
bool compare(struct node n1, struct node n2) {
	return n1.weight > n2.weight;
}
void dfs(int start) {
	path.push_back(w[start]);
	sum += w[start];
	if (!tree[start].size()) {
		if (sum == S) {
			for (int i = 0; i < path.size(); i++) {
				cout << path[i];
				if (i == path.size() - 1) cout << endl;
				else cout << " ";
			}
		}
		sum -= w[start];
		path.pop_back();
		return;
	}
	for (int i = 0; i < tree[start].size(); i++) {
		dfs(tree[start][i].no);
	}
	sum -= w[start];
	path.pop_back();
	return;
}
int main() {
	cin >> N >> M >> S;
	for (int i = 0; i < N; i++) cin >> w[i];
	for (int i = 1; i <= M; i++) {
		int root, number;
		scanf("%02d %d", &root, &number);
		for (int j = 1; j <= number; j++) {
			struct node temp;
			cin >> temp.no; temp.weight = w[temp.no];
			tree[root].push_back(temp);
		}
		sort(tree[root].begin(), tree[root].end(), compare);
	}
	dfs(0);
	return 0;
}