This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
typedef long long int ll;
int n;
ll t[maxn];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
ll sum = 0;
ll mx = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> t[i];
sum += t[i];
mx = max(mx, t[i]);
}
for (int i = 1; i <= n - 1; i++) {
int a, b;
cin >> a >> b;
sum += max(t[a], t[b]);
}
cout << sum - mx;
}
# | 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... |