洛谷P2820 最小生成树 经典例题 代码与解析

    #include<iostream>
    #include<queue>
    using namespace std;
    struct node{
    	int index;
    	int dis;
    	node(int i,int d):index(i),dis(d)
    	{}
    };
    struct cmp{
    	bool operator()(node a,node b)
    	{
    		return a.dis>b.dis;
    	}
    };
    int vis[110]; 
    int dist[110][110];
    int main()
    {
    	int count=0;
    	int TreeLength=0;
    	int TotalLength=0;
    	priority_queue<node,vector<node>,cmp>no;
    	int n,k;
    	int