#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int n,w[105][105],l[105],vis[105],kmin,sum=0;
int main()
{
//多组输入
while(~scanf("%d",&n))
{
memset(vis,0,sizeof vis);
sum=0;
memset(w,0x3f3f3f3f,sizeof w);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&w[i][j]);
// for(int i=1;i<=n;i++)
// {
// for(int j=1;j<=n;j++)
// cout<<w[i][j]<<" ";
// cout<<endl;
// }
memset(l,0x3f3f3f3f,sizeof l);l[1]=0;
int k;
for(int i=1;i<=n;i++)
{
kmin=0x3f3f3f3f;
for(int j=1; j<=n;j++)
{
if(!vis[j] && l[j]<kmin)///
k=j,kmin=l[j];
}
// cout<<k<<","<<kmin<<endl;
vis[k]=1;
sum+=l[k];
for(int j=1;j<=n;j++)
{
if(!vis[j] && w[k][j]<l[j])
l[j]=w[k][j];
// cout<<k<<","<<j<<","<<l[j]<<endl;
}
// cout<<endl;
// cout<<endl;
}
cout<<sum<<endl;
}
}
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<algorithm>
using namespace std;
int n,w[105][105],k,l[105],vis[105],sum,u,cnt;
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >q;
void prim()
{
memset(vis,0,sizeof vis);
memset(l,0x3f3f3f3f,sizeof l);
sum=0;
q.push(make_pair(0,1));
while(!q.empty() && cnt<n)
{
k=q.top().second;//权值最小的点
u=q.top().first;
q.pop() ;
if(vis[k]) continue;
vis[k]=1;//
sum+=u;
// cout<<k<<"_____"<<u<<"______"<<sum<<endl;
for(int j=1;j<=n;j++)
{
if(!vis[j] && w[k][j]<l[j])
{
l[j]=w[k][j];
// cout<<k<<","<<j<<","<<l[j]<<endl;
q.push(make_pair(l[j],j));
}
}
}
cout<<sum<<endl;
}
int main()
{
while(~scanf("%d",&n))
{
memset(w,0x3f3f3f3f,sizeof w);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&w[i][j]);
prim();
}
}
小根堆
#include<bits/stdc++.h>
//#include <iostream>
//#include <queue>
using namespace std;
struct Node{
int x, y;
Node(int a=0, int b=0):x(a),y(b){}
};
bool operator<(Node a, Node b){//返回true时,说明a的优先级低于b
//x值较大的Node优先级低(x小的Node排在队前)
//x相等时,y大的优先级低(y小的Node排在队前)
if( a.x== b.x ) return a.y> b.y;
return a.x> b.x;
}
int main(){
priority_queue<Node> q;
for( int i= 0; i< 10; ++i )
q.push( Node( rand(), rand() ) );
while( !q.empty() ){
cout << q.top().x << ' ' << q.top().y << endl;
q.pop();
}
return 0;
}
关于stl里面priority_queue 的各种写法
https://www.cnblogs.com/Deribs4/p/5657746.html