Submission #1047910

#TimeUsernameProblemLanguageResultExecution timeMemory
1047910Maite_MoraleRoad Closures (APIO21_roads)C++17
5 / 100
25 ms3792 KiB
#include <bits/stdc++.h>
using namespace std;

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,std::vector<int> V,std::vector<int> W) {
  sort(W.begin(),W.end());
  std::vector<long long> r(N, 0);
  long long s=0;
  for(int i=0;i<N-1;i++){
      s+=W[i];
      r[W.size()-i-1]=s;
  }
return r;
}
#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...