Submission #1182759

#TimeUsernameProblemLanguageResultExecution timeMemory
1182759nguyenkhangninh99Sjekira (COCI20_sjekira)C++20
110 / 110
15 ms1096 KiB
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 1; long long a[N]; pair<int, int> e[N]; signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin >> n; long long res = 0, mx = 0; for(int u = 1; u <= n; ++u) { cin >> a[u]; res += a[u]; mx = max(mx, a[u]); } res -= mx; for(int i = 1, u, v; i < n; ++i) { cin >> u >> v; res += max(a[u], a[v]); } cout << res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...