#include <iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
int n, v; cin >> n;
for (int i = 1; i < n; ++i)
cin >> v >> v;
int m, ans = 0; cin >> m;
vector<vector<int>> arr, arr2;
for (int i = 0; i < m; ++i) {
int x, y, z; cin >> x >> y >> z;
if (x > y) swap(x, y);
arr.push_back({ y, x, z, i });
}
sort(arr.begin(), arr.end());
for (auto x : arr)
arr2.push_back({ x[1], x[0], x[2], x[3] });
auto it = arr2.begin();
while (it != arr2.end()) {
ans += (*it)[2];
vector<int> x = { (*it)[1]+1, 0, 0, 0 };
it = lower_bound(arr2.begin(), arr2.end(), x);
}
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |