#include "roads.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 5e18
#define nl '\n'
vector<ll> minimum_closure_costs(int n, vector<int> a, vector<int> b, vector<int> w){
sort(w.begin(), w.end());
vector<ll> ans(n);
ll sum = 0;
ans[n-1] = 0;
for(ll i=n-2; i>=0; i--){
sum += w[n-2-i];
ans[i] = sum;
}
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... |