Prim爆0

#include <iostream>
#include <cstring>
using namespace std;
const int maxn = 100;
int n, k;
int sum;
int f[maxn][maxn];
int minn[maxn];
bool flag[maxn];
int main() {
    cin >> n >> k;
    memset(f, 127, sizeof(f));
    for (int i = 1; i <= k; i++) {
        int j, k;
        cin >> j >> k;
        cin >> f[j][k];
        f[k][j] = f[j][k];
        sum += f[j][k];
    }
    memset(minn, 127, sizeof(minn));
    memset(flag, true, sizeof(flag));
    minn[1] = 0;
    for (int i = 1; i <= n; i++) {
        int l = 0;
        for (int j = 1; j <= n; j++)
            if (flag[j] == true && minn[j] < minn[l])
                l = j;
        flag[l] = false;
        for (int j = 1; j <= n; j++)
            if (flag[j] == true && f[l][j] < minn[j])
                minn[j] = f[l][j];
    }
    int ans = 0;
    for (int i = 1; i <= n; i++)
        ans += minn[i];
    cout << sum - ans;
    return 0;
}