# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
298580 | ak2006 | Traffic (IOI10_traffic) | C++14 | 0 ms | 0 KiB |
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;
#define int long long
int32_t main()
{
int n;
cin>>n;
vector<int>p(n);
int tot = 0;
for(int i = 0;i<n;i++){cin>>p[i];tot+=p[i];}
vector<vector<int>>adj(n);
for(int i = 0;i<n-1;i++){int a,b;cin>>a>>b;adj[a].push_back(b);adj[b].push_back(a);}
int ans = 1e15,cur = 0;
for(int i = 0;i<n;i++){ans = min(ans,max(cur,tot-cur));}
cout<<ans;
return 0;
}