#include "roads.h" #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define sz(a) (int)a.size() #define all(a) a.begin(),a.end() using ll = long long; const int maxn = (int)2e5+10; const int INF = (int)1e9; vector<ll> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W) { vector<ll> ans(N,0ll); sort(all(W)); reverse(all(W)); int i = 0; ll tot = accumulate(all(W),0ll); for(auto &u : ans) u=tot,tot-=W[i++]; return ans; }