#include "bits/stdc++.h"
#include "roads.h"
// #include "grader.cpp"
using namespace std;
#define ll long long
vector<ll> minimum_closure_costs(int n, vector<int> u1,
vector<int> u2, vector<int> w) {
vector <ll> ans(n, 0);
sort(w.rbegin(), w.rend());
ll s = 0;
for(int i = n-2; i >= 0; i--) {
s += (w.back());
w.pop_back();
ans[i] = s;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |