#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define s second
#define f first
#define left (h<<1),l,(l+r)>>1
#define right ((h<<1)|1),((l+r)>>1) + 1,r
using namespace std;
const int N = 100005;
ll a[N],n,ans,mx;
signed main (){
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
cin>>n;
for (int i = 1; i <= n; i++){
cin>>a[i];
ans += a[i];
if (a[i] > mx) mx = a[i];
}
ans-=mx;
for (int i = 1; i < n; i++){
int x,y;
cin>>x>>y;
ans+=max(a[x],a[y]);
}
cout<<ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
908 KB |
Output is correct |
2 |
Correct |
15 ms |
2012 KB |
Output is correct |
3 |
Correct |
16 ms |
2016 KB |
Output is correct |
4 |
Correct |
18 ms |
2240 KB |
Output is correct |
5 |
Correct |
33 ms |
3184 KB |
Output is correct |
6 |
Correct |
31 ms |
3132 KB |
Output is correct |
7 |
Correct |
24 ms |
2760 KB |
Output is correct |
8 |
Correct |
20 ms |
2576 KB |
Output is correct |
9 |
Correct |
13 ms |
1784 KB |
Output is correct |
10 |
Correct |
24 ms |
3140 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
20 ms |
908 KB |
Output is correct |
7 |
Correct |
15 ms |
2012 KB |
Output is correct |
8 |
Correct |
16 ms |
2016 KB |
Output is correct |
9 |
Correct |
18 ms |
2240 KB |
Output is correct |
10 |
Correct |
33 ms |
3184 KB |
Output is correct |
11 |
Correct |
31 ms |
3132 KB |
Output is correct |
12 |
Correct |
24 ms |
2760 KB |
Output is correct |
13 |
Correct |
20 ms |
2576 KB |
Output is correct |
14 |
Correct |
13 ms |
1784 KB |
Output is correct |
15 |
Correct |
24 ms |
3140 KB |
Output is correct |
16 |
Correct |
1 ms |
340 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
7 ms |
956 KB |
Output is correct |
22 |
Correct |
7 ms |
856 KB |
Output is correct |
23 |
Correct |
35 ms |
3040 KB |
Output is correct |
24 |
Correct |
18 ms |
2236 KB |
Output is correct |
25 |
Correct |
16 ms |
2264 KB |
Output is correct |
26 |
Correct |
14 ms |
1620 KB |
Output is correct |
27 |
Correct |
13 ms |
1756 KB |
Output is correct |
28 |
Correct |
16 ms |
2012 KB |
Output is correct |
29 |
Correct |
11 ms |
1364 KB |
Output is correct |
30 |
Correct |
25 ms |
3124 KB |
Output is correct |