Tietoverkko

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

vector<struct A> c;
vector<int> a[200000];
    
struct A {
    int a;
    int b;
    int x;
};

bool a_comp(struct A q, struct A b)
{
    return q.x < b.x;
}

int maara(int q, int pois)
{
    int m = 1;
    for(int naapuri: a[q]) {
        if(naapuri != pois) {
            m += maara(naapuri, q);
        }
    }
    return m;
}

int main()
{
    int n;
    cin >> n;

    for(int i = 0; i < n - 1; i++) {
        struct A b;
        cin >> b.a >> b.b >> b.x;
        c.push_back(b);
        a[b.a].push_back(b.b);
        a[b.b].push_back(b.a);
    }

    sort(c.begin(), c.end(), a_comp);

    uint64_t summa = 0;
    int h = 0;
    int u = 0;
    for(struct A i: c) {
        //cout << "A: " << i.a << " " << i.b << " " << i.x << endl;
        //cout << maara(i.a, i.b) << endl;
        /*for(int naapuri: a[i.a]) {

        }*/
        if(u < i.x) {
            summa += (n - h - 1) * i.x;
            u = i.x;
        }
        h++;
    }

    cout << summa << endl;
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: RUNTIME ERROR