Laskettelukeskus

#include <iostream>
#include <queue>

int main() {
    int rinteet;
    std::cin >> rinteet;

    std::priority_queue<std::pair<int, int>> queue;
    std::vector<std::pair<int, int>> huiput;

    for (int i = 0; i < rinteet-1; ++i) {
        int n1;
        int n2;

        std::cin >> n1 >> n2;

        queue.push(std::pair(n2, n1));
    }

    for (int i = 0; i < rinteet; ++i) {
        int n;
        std::cin >> n;
        huiput.push_back(std::pair(n, 0));
    }

    while (!queue.empty()) {
        auto item = queue.top();
        huiput[item.second-1].second += std::max(huiput[item.first-1].first, huiput[item.first-1].second);
        queue.pop();
    }

    std::cout << huiput.front().second << "\n";
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 2

Verdict: WRONG ANSWER

Test 5

Group: 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: WRONG ANSWER