全RE求调

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+5;
vector<pair<int,ll> > f[N];
ll ans[N],n,m,sign[N];
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int u,v;
		ll w;
		cin>>u>>v>>w;
		f[u].push_back({v,w});
		f[v].push_back({u,w});
	}
	memset(ans,0x3f,sizeof(ans));
	ans[1]=0;
	sign[1]=1;
	int now;
	int sum1=0;
	while(sum1<n)
	{
		ll minn=1e18;
		for(int i=1;i<=n;i++)
		{
			if(minn>ans[i]&&!sign[i])
			{
				minn=ans[i];
				now=i;
			}
		}
		sign[now]=1;
		sum1++;
		for(auto i:f[now])
		{
			int v=i.first;
			ll w=i.second;
			if(!sign[v])
				ans[v]=min(ans[v],w);
		}
	}
	ll sum=0;
	for(int i=1;i<=n;i++)
	{
		sum+=ans[i];
		if(ans[i]==ans[0])
		{
			cout<<"orz";
			return 0;
		}
	}
	cout<<sum;
	return 0;
}