Submission #60528234

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;

void solve() {
    ll N, M, K;
    cin >> N >> M >> K;
    vector<array<ll, 3>> e(M);
    for (auto& [w, u, v] : e) {
        cin >> u >> v >> w;
        u--, v--;
    }
    vector<ll> A(K), B(K);
    for (ll i = 0; i < K; i++) {
        cin >> A[i];
        --A[i];
    }
    for (ll i = 0; i < K; i++) {
        cin >> B[i];
        --B[i];
    }
    sort(e.begin(), e.end());
    ll wt = 0, cur = -1;
    vector<ll> vals(N, 0);
    vector<ll> comp(N, -1);
    for (auto [w, u, v] : e) {
        if (w > wt) {
            wt = w;
            cur++;
            vals[cur] = wt;
        }
        if (comp[u] == -1) {
            comp[u] = cur;
        }
        if (comp[v] == -1) {
            comp[v] = cur;
        }
    }
    sort(A.begin(), A.end(), [&](ll i, ll j) {
        return comp[i] < comp[j];
    });
    sort(B.begin(), B.end(), [&](ll i, ll j) {
        return comp[i] < comp[j];
    });
    ll ans = 0;
    for (ll i = 0; i < K; i++) {
        ans += vals[max(comp[A[i]], comp[B[i]])];
    }
    cout << ans;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int T = 1;
    //cin >> T;
    while (T--)
        solve();
}

Submission Info

Judge Result