# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
570121 | Garguy22 | 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>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define pb push_back;
vl minimum_closure_costs(int N, vi U, vi V, vi W){
ll temp = 0;
vi ans;
sort(W.begin(), W.end());
ans.pb(0);
for(int i = 0; i < n; i++){
temp += w[i];
ans.pb(temp);
}
reverse(ans.begin(), ans.end());
return ans;
}