#include "bits/stdc++.h"
#include "roads.h"
// #include "grader.cpp"
using namespace std;
#define ll long long
ll sum, n, ans;
vector <ll> v;
vector<ll>minimum_closure_costs(int N,vector<int> U,vector<int> V,vector<int> W) {
for(auto i : W) {
sum += i;
}
sort(W.rbegin(),W.rend());
v.push_back(sum);
for(auto i : W) {
sum -= i;
v.push_back(sum);
}
return v;
}
# | 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... |