次小生成树(prim+堆)

我都不知道我为啥要用堆来优化,代码量大且毫无意义

#include<map>
#include<set>
#include<cmath>
#include<stack>
#include<queue>
#include<cstdio>
#include<string>
#include<vector>
#include<cstring>
#include<iomanip>
#include<sstream>
#include<iostream>
#include<algorithm>
#define INF 0x3f3f3f3f
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
//#define ll __int64
//#define int ll
typedef  long long ll;
typedef unsigned long long ull;
const int MAXN=1e2+10;
const int MOD=1e9+7;
const double eps=1e-6;
const double finf=1e10;
using namespace std;
template<class T>inline void read(T &res)
{
    
    
    char c;T flag=1;
    while((c=getchar())<'0'||c>'9')if(c=='-')flag=-1;res=c-'0';
    while((c=getchar())>='0'&&c<='9')res=res*10+c-'0';res*=flag;
}
//-------------------------------------------//
struct edges
{
    
    
    int from,to,next;
    int dis;
}E[MAXN*MAXN];
struct node
{
    
    
    int u,v;
    int dis;
    node(int x,int y,int d):u(x),v(y),dis(d){
    
    }
    bool operator<(const node& a)const
    {
    
    
        return dis>a.dis;
    }
};
int vis[MAXN],head[MAXN],cnt,n,m;
int maxd[MAXN][MAXN],used[MAXN][MAXN];
int prim()
{
    
    
    priority_queue<node> q;
    int cnt=0,sum=0;
    vis[1]=1;cnt++;
    for(int i=head[1];~i;i=E[i].next)
        q.push(node(E[i].from,E[i].to,E[i].dis));
    while(!q.empty()&&cnt<n)
    {
    
    
        node x=q.top();q.pop();
        if(vis[x.v])continue;
        vis[x.v]=1;cnt++;
        used[x.u][x.v]=used[x.v][x.u]=1;
        sum+=x.dis;
        for(int i=1;i<=n;++i)
            if(vis[i]&&i!=x.v)maxd[x.v][i]=maxd[i][x.v]=max(maxd[i][x.u],x.dis);
        for(int i=head[x.v];~i;i=E[i].next)
        {
    
    
            if(vis[E[i].to])continue;
            q.push(node(E[i].from,E[i].to,E[i].dis));
        }
    }
    if(cnt<n)return -1;
    return sum;
}
void addedge(int u,int v,int w)
{
    
    
    E[cnt].dis=w;
    E[cnt].from=u;
    E[cnt].to=v;
    E[cnt].next=head[u];
    head[u]=cnt++;
}
void init()
{
    
    
    for(int i=0;i<=n;++i)
    {
    
    
        head[i]=-1;
        vis[i]=0;
        for(int j=0;j<=n;++j)maxd[i][j]=0,used[i][j]=0;
    }
    cnt=0;
}
int main()
{
    
    
    int t;
    read(t);
    while(t--)
    {
    
    
        read(n);read(m);
        init();
        for(int i=0;i<m;++i)
        {
    
    
            int u,v,w;
            read(u);read(v);read(w);
            addedge(u,v,w);
            addedge(v,u,w);
        }
        int mst=prim();
        int ans=INF;
        for(int i=0;i<cnt;++i)
        {
    
    
            if(!used[E[i].from][E[i].to])
            ans=min(ans,mst-maxd[E[i].from][E[i].to]+E[i].dis);
        }
        printf("%d %d\n",mst,ans);
    }
    return 0;
}