逆天

朋友

好玩的代码

   //好玩的代码
   #include<bits/stdc++.h>
   using namespace std;
   int main(){
      while(1){
        cout<<"\a";
      }
      return 0;
   }

//馈赠
  题目名：最小生成树
  #include<bits/stdc++.h>
using namespace std;
const int N=500005;
int n,m,ans,cnt;
struct edge{
	int v,w;
};
vector<edge> e[N];
int d[N];
bool vis[N];
bool prim(int x){
	memset(d,0x3f,sizeof d);
	d[x]=0;
	for(int i = 1;i<=n;i++){
		int u=0;
		for(int j=1;j<=n;j++){
			if(!vis[j]&&d[j]<d[u])u=j;	
		}
		vis[u]=true;
		ans+=d[u];
		if(d[u]!=0x3f3f3f3f)cnt++;
		for(auto ed:e[u]){
			int v=ed.v;
			int w=ed.w;
			if(w<d[v]){
				d[v]=w;	
			} 
		}
	}
	return cnt==n;
}
int main(){
	cin>>n>>m;
	for(int i = 1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		e[u].push_back({v,w});
		e[v].push_back({u,w});
	}
	if(prim(1)){
		cout<<ans;
	}else{
		cout<<"orz";
	}
	return 0;
}