PAT 甲级1053(测试点6答案错误) —— vector二维数组排序

错误原因，参考博客

正确代码如下(似乎这种思路更容易理解)

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

const int maxn = 110;
int n, m, s,cnt = 0;
vector<int> path, ans[maxn];
struct Node{
	int weight;
	vector<int> child;
}node[maxn];
bool cmp(vector<int> a, vector<int> b) {
	for(int i = 0;i < a.size() && i < b.size(); i++) 
		if(a[i] != b[i]) return a[i] > b[i];
}
void DFS(int index, int sum) {
	path.push_back(node[index].weight);
	if(sum > s) return;
	if(node[index].child.size() == 0) {
		if(sum == s) ans[cnt++]=path;
		return ;
	}
	for(int i = 0;i<node[index].child.size();i++) {
		DFS(node[index].child[i], sum + node[node[index].child[i]].weight);
		path.pop_back();
	}
}
int main() {
	cin >> n >> m >> s;
	for(int i = 0;i<n;i++) cin >> node[i].weight;
	for(int i = 0;i<m;i++) {
		int parent, k, id;
		cin >> parent >> k;
		for(int j = 0;j<k;j++) {
			cin >> id;
			node[parent].child.push_back(id);
		}
	}
	DFS(0, node[0].weight);
	sort(ans, ans+cnt, cmp);
	for(int i = 0;i<cnt;i++) {
		if(i) cout << endl;
		for(int j = 0;j<ans[i].size();j++) {
			if(j) cout << " ";
			cout << ans[i][j];
		}
	}
	return 0;
}