可爱的 #7、#8、#9RE了qwq

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>

using namespace std;

const int N = 510, INF = 0x3f3f3f3f;

int n, m, g[N][N], dist[N];
bool st[N];

int prim(){
    memset (dist, INF, sizeof dist);
    
    int res = 0;
    
    for (register int i = 0; i < n; i ++ ){
        int t = -1;
        for (register int j = 1; j <= n; j ++ )
            if (!st[j] && (t == -1 || dist[t] > dist[j]))
                t = j;
        
        if (i && dist[t] == INF){
            return INF;
        }
        
        if (i) res += dist[t];
        
        st[t] = true;
        
        for (register int j = 1; j <= n; j ++ )
            dist[j] = min(dist[j], g[t][j]);
    }
    
    return res;
}

int main(){
    scanf("%d %d", &n, &m);
    int u, v, w;
    
    for (register int i = 1; i <= n; i ++ )
        for (register int j = 1; j <= n; j ++ )
            g[i][j] = i == j ? 0 : INF;
    
    while (m -- )
    {
        scanf("%d %d %d", &u, &v, &w);        
        g[u][v] = g[v][u] = min(g[u][v], w);
    }
    
    int t = prim();
    
    t == INF ? puts("orz") : printf("%d\n", t);
    return 0;
}