Cod sursa(job #3327910)

Utilizator eugenioMarinescu Eugenio eugenio Data 5 decembrie 2025 17:14:25
Problema Arbore partial de cost minim Scor 70
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.97 kb
#include <bits/stdc++.h>
#define inf 2000000
using namespace std;
#define cin fin
#define cout fout
ifstream cin("apm.in");
ofstream cout("apm.out");

int tata[200005], n, m, x, y, c, sol;

struct mch
{
    int x;
    int y;
    int cost;
}v[400005];
vector<mch> pp;

bool cmp(mch a, mch b)
{
    return (a.cost<b.cost);
}

int parinte(int nod)
{
    if(tata[nod]!=-1)
        return parinte(tata[nod]);
    return nod;
}

int main()
{
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y>>c;
        v[i]={x,y,c};
    }
    for(int i=1; i<=n; i++)
        tata[i]=-1;
    sort(v+1,v+m+1,cmp);
    for(int i=1; i<=m; i++)
    {
        int rx=parinte(v[i].x);
        int ry=parinte(v[i].y);
        if(rx!=ry)
        {
            tata[rx]=ry;
            pp.push_back(v[i]);
            sol+=v[i].cost;
        }
    }
    cout<<sol<<'\n'<<pp.size()<<'\n';
    for(auto elem : pp)
        cout<<elem.x<<' '<<elem.y<<'\n';
}