#include "roads.h"
#define F first
#define S second
#define ll long long
#define in insert
#define pb push_back
#include <bits/stdc++.h>
using namespace std;
std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,std::vector<int> V,std::vector<int> W){
vector<ll> ret;
sort(W.begin(),W.end());
ll sum=0;
ret.pb(0);
for(auto u : W){
sum+=u;
ret.pb(sum);
}
reverse(ret.begin(),ret.end());
return ret;
}
# | 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... |