Cod sursă (job #804449)

#include <bits/stdc++.h>
using namespace std;

ifstream fin("zapada.in");
ofstream fout("zapada.out");
struct muchie
{
    int c;
    short x,y;
    bool operator< (muchie m) const
    {
        return c < m.c;
    }
};
muchie a[100005];
int n, m, t[100005], costTotal, k;

void Union(int x, int y)
{
    t[y] = x;
}

int Find(int x)
{
    int y, rad = x;
    while (t[rad] != 0)
        rad = t[rad];
    while (x != rad)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}

void Citire()
{
    fin >> n >> m >> k;
    for (int i = 1; i <= m; i++)
        fin >> a[i].x >> a[i].y >> a[i].c;
}

void Kruskal()
{
    int i, nrc = n, x, y;
    sort(a + 1, a + m + 1);
    for(i = 1; i <= m && nrc > 1; i++)
    {
        x = Find(a[i].x);
        y = Find(a[i].y);
        if (x != y)
        {
            Union(x, y);
            nrc--;
            costTotal += a[i].c;
            a[i].ales = 1;
        }
    }
}

void Afis()
{
    fout << costTotal << "\n";
}

int main()
{
    Citire();
    Kruskal();
    Afis();
    for(int i = 1; i <= k; i++)
    {
        m++;
        fin >> a[m].x >> a[m].y >> a[m].c;
        costTotal = 0;
        for(int j = 1; j <= n; j++)
            t[j] = 0;
        Kruskal();
        Afis();
    }
    return 0;
}