Остов с наименьшим максимальным ребром

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <tuple>
#include <map>

using namespace std;

class DSU {
public:
    vector<int> parent;
    vector<int> height;

    DSU(int n) {
        parent.resize(n);
        for (int i = 0; i < n; ++i) {
            parent[i] = i;
        }
        height.assign(n, 0);
    }

    int findRoot(int v) {
        if (v == parent[v]) {
            return v;
        }
        int ans = findRoot(parent[v]);
        parent[v] = ans;
        return ans;
    }

    void Union(int v1, int v2) {
        if (height[v1] >= height[v2]) {
            parent[v2] = v1;
            height[v1] = max(height[v1], height[v2] + 1);
        } else {
            parent[v1] = v2;
            height[v2] = max(height[v2], height[v1] + 1);
        }
    }


};

int main() {
    int n, m;
    cin >> n >> m;
    vector<pair<double, pair<int, int>>> edges;
    map<pair<int, int>, int> edges_num;
    for (int i = 0; i < m; ++i) {
        int x, y, w;
        cin >> x >> y >> w;
        edges.push_back({w, {--x, --y}});
        if (!edges_num.contains({x, y})){
            edges_num[{x, y}] = i;
        }
    }
    DSU graph(n);
    sort(edges.begin(), edges.end());
    double ans = 0;
    for (auto [weight, coords]: edges) {
        if (graph.findRoot(coords.first) != graph.findRoot(coords.second)){
            graph.Union(graph.findRoot(coords.first), graph.findRoot(coords.second));
            ans += weight;
            cout << edges_num[coords] + 1 << " ";
        }
    }
//    cout << '\n' << ans;
    return 0;
};