#include "roads.h"
#include <bits/stdc++.h>
#define ll long long
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> v(N);
sort(W.begin(),W.end());
ll sm=0;
for (int i=0;i<N;i++)
{
sm+=W[i];
}
ll j=N-2;
for (int i=0;i<N;i++)
{
v[i]=sm;
sm-=W[j];
j--;
}
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... |