제출 #844125

#제출 시각아이디문제언어결과실행 시간메모리
844125Alem도로 폐쇄 (APIO21_roads)C++14
5 / 100
55 ms5684 KiB
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V, vector<int> W){
	long long k = 0;
	vector<long long> a(N,0);
	sort(W.begin(),W.end(),greater<int>());
	for (int i = N - 1; i >= 0; i--) {
		a[i] = k;
		if (i > 0){
			k += W[i - 1];
		}
	}
	return a;
}
#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...