11631.cpp

/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */
#include <bits/stdc++.h>
using namespace std;

#define inf       10000000
#define mem(a, b) memset(a, b, sizeof(a))
#define NN        200000
int prnt[NN + 7];
struct data {
    int u, v, w;
};
vector<data> e;
bool comp(data n, data m) { return n.w < m.w; }

int root(int n) {
    if (prnt[n] == n) return n;
    return root(prnt[n]);
}

int mst(int n) {
    sort(e.begin(), e.end(), comp);
    int i, j, k, node, dist;
    for (i = 0; i <= n; i++) prnt[i] = i;
    node = dist = 0;
    for (i = 0; i < e.size() && node < n - 1; i++) {
        int u = root(e[i].v);
        int v = root(e[i].u);
        if (u != v) {
            prnt[u] = v;
            node++;
            dist += e[i].w;
        }
    }
    return dist;
}

int main() {
    // freopen("C:\\Users\\Maruf Tuhin\\Desktop\\in.txt","r",stdin);
    // ios_base::sync_with_stdio(false);
    int i, j, k, l, n, r, c, u, v;
    int tc, t = 1, sum = 0;
    // scanf("%d",&tc);
    while (~scanf("%d%d", &n, &r)) {
        if (n == 0 && r == 0) return 0;
        k = 0;
        sum = 0;
        for (i = 0; i < r; i++) {
            scanf("%d%d%d", &u, &v, &l);
            data d;
            d.u = u;
            d.v = v;
            d.w = l;
            sum += l;
            e.push_back(d);
        }
        int ret = mst(n);
        ret = sum - ret;
        printf("%d\n", ret);
        e.clear();
    }
    return 0;
}