Cod sursă (job #804460)

#include <bits/stdc++.h>
using namespace std;
ifstream fin("zapada.in");
ofstream fout("zapada.out");
struct muchie
{
    short x,y;
    int  c;
    bool operator < (const muchie& other) const
    {
        return this->c < other.c;
    }
};
int r[100005], t[100005];
int n, m, x, y,c,k,totalcost;
vector<muchie>a,v;
void Union(int x, int y)
{
    if (r[x] > r[y])
    {
        t[y] = x;
    }
    else
    {
        t[x] = y;
        if (r[x] == r[y])
            r[y]++;
    }
}

int Find(int x)
{
    if (t[x] == 0)
        return x;
    int y = Find(t[x]);
    t[x] = y;
    return y;
}
void krusk2004()
{
    sort(v.begin(),v.end());
    for(int i=1;i<=n;i++)
    {
        t[i]=0;
    }
    for(int i = 0; i <= m; i++)
    {
        int x = Find(v[i].x);
        int y = Find(v[i].y);
        if (x != y)
        {
            Union(x, y);
            a.push_back(v[i]);
            totalcost += v[i].c;
        }
    }
}

int main()
{
    fin >> n >> m>>k;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        v.push_back({x,y,c});
    }
    krusk2004();
    fout<<totalcost<<"\n";
    while(k--)
    {
        fin >> x >> y >> c;
        if(a[a.size()-1].c>c)
        {
            a.push_back({x,y,c});
            for(int i=a.size()-1;i>0;i--)
                if(a[i].c<a[i-1].c)
                    swap(a[i],a[i-1]);
                else
                    break;
        }
            v=a;
            a.clear();
            totalcost=0;
            for(int i=1;i<=n;i++)
            {
                t[i]=0;
                r[i]=0;
            }
             for(int i=0;i<n;i++)
            {
                int x=Find(v[i].x);
                int y=Find(v[i].y);
                if(x!=y)
                {
                    Union(x,y);
                    a.push_back(v[i]);
                    totalcost+=v[i].c;
                }
            }
            fout << totalcost << '\n';
        }

    }