# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
722425 | grossly_overconfident | 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 endl '\n'
//#define int long long
//#define INT_MAX LONG_LONG_MAX
vector<long long> minimum_closure_cost(int n, vector<int> u, vector<int> v, vector<int> w){
sort(w.begin(), w.end());
vector<long long> out(n);
int j = 0;
for (int i = n - 2; i >= 0; --i){
out[i] = out[i + 1] + w[j];
j++;
}
return out;
}