Submission #964675

#TimeUsernameProblemLanguageResultExecution timeMemory
964675kilkuwuRoad Closures (APIO21_roads)C++17
5 / 100
46 ms5564 KiB
#include "roads.h"

#include <bits/stdc++.h>

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {

  std::vector<long long> res(N);
  std::sort(W.begin(), W.end());

  long long ans = 0;
  for (int i = N - 1; i > 0; i--) {
    int j = N - i - 1;
    res[i] = ans;
    ans += W[j];
  }
  res[0] = ans;
  return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...