1053 Path of Equal Weight (30 分)-------带权树的DFS

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
const int maxn=110;
struct Node
{
    int weight;
    vector<int> child;
}node[maxn];

bool cmp(int a,int b)
{
    return node[a].weight>node[b].weight;
}

int n,m,s;
int path[maxn];

void DFS(int index,int numNode,int sum)
{
    if(sum>s)
        return;
    if(sum==s)
    {
        if(node[index].child.size()!=0)
            return;
        else
        {
            for(int i=0;i<numNode;i++)
            {
                cout<<node[path[i]].weight;
                if(i==numNode-1)
                    cout<<endl;
                else
                    cout<<' ';
            }
        }
        return ;
    }
    else
    {
        for(int i=0;i<node[index].child.size();i++)
        {
            int child=node[index].child[i];
            path[numNode]=child;
            DFS(child,numNode+1,sum+node[child].weight);
        }
    }
}



int main()
{
    cin>>n>>m>>s;
    for(int i=0;i<n;i++)
        cin>>node[i].weight;
    int id,k,child;
    for(int i=0;i<m;i++)
    {
        cin>>id>>k;
        for(int j=0;j<k;j++)
        {
            cin>>child;
            node[id].child.push_back(child);
        }
        sort(node[id].child.begin(),node[id].child.end(),cmp);
    }
    path[0]=0;
    DFS(0,1,node[0].weight);
    return 0;
}

第一个:这里的sort我是第一次见到
bool cmp(int a,int b)
{ return node[a].weight>node[b].weight; }
这个sort竟然的参数时int,而在函数内它直接比较了Node型结构体的变量node