| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1056088 | KasymK | 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;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e5+5;
ll F[N], par[N];
vector<ll> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w){
sort(all(w));
vector<ll> A;
ll sm = accumulate(all(w), 0ll);
for(int k = 0; k < n; ++k){
A.pb(sm);
sm -= w[n-k-2];
}
return A;
}
int main(){
vector<ll> kk = minimum_closure_costs(5, {0, 0, 0, 0}, {1, 2, 3, 4}, {1, 4, 3, 2});
for(auto i : kk)
printf("%lld ", i);
puts("");
return 0;
}