# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
569346 | Akiti | Road Closures (APIO21_roads) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using ll =long long;
struct edge
{
int a, b, c;
};
bool compaire(edge g, edge h)
{
return g.c > h.c;
}
vector <ll> minimum_closure_costs(ll n, vector <ll> u, vector <ll> v, vector <ll> w)
{
ll sum = 0;
ll m = u.size();
vector <edge> d(m);
vector <ll> t;
for (ll i = 0; i < m; i++)
{
sum+= w[i];
d[i].a = u[i];
d[i].b = v[i];
d[i].c = w[i];
}
sort(d.begin(), d.end(), compaire);
for (ll k = 0; k <= m; k++)
{
ll sum2 = sum;
for (ll i = 0, s = k; s > 0; i++, s--)
sum2-= d[i].c;
t.push_back(sum2);
}
return t;
}