# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
626963 | Glory | 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>
#define int long long
#define vi vector<int>
using namespace std;
vi minimum_closure_costs(int N,vi U,vi V,vi W){
vi ans(N+100,0);
int res = 0;
for(int i=0; i< N; i++){
res+= W[i];
}
sort(W.begin(),W.end(),greater<int>());
ans[0]=res;
for(int i=1; i< N; i++){
res-=W[i-1];
ans[i]=res;
}
return ans;
}