# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569304 | gavgav | Road Closures (APIO21_roads) | C++17 | 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 ll long long
int64_t[] minimum_closure_costs(int n,int[] u,int[] v,int[] w){
ll ws[n]{};
ll sum=0;
for(ll i=1;i<n;ws[i]=w[i-1],sum+=w[i-1],++i);
sort(ws+1,ws+n,greter<ll>());
ll ans[n]{sum};
for(ll i=1;i<n;++i){
ans[i]=ans[i-1]-w[i-1];
}
return ws;
}