# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
925238 | TAhmed33 | 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;
typedef long long ll;
vector <ll> minimum_closure_costs (int N, vector <int> u, vector <int> v, vector <int> w) {
vector <ll> ans;
sort(w.begin(), w.end());
ll pref[(int)w.size() + 1] = {};
for (int i = 0; i < (int)w.size(); i++) {
pref[i + 1] = w[i + 1] + pref[i];
}
for (int i = 0; i < n; i++) {
ans.push_back(pref[n - 1 - i]);
}
return ans;
}