제출 #1177959

#제출 시각아이디문제언어결과실행 시간메모리
1177959Muhammet도로 폐쇄 (APIO21_roads)C++17
5 / 100
30 ms3772 KiB
#include "bits/stdc++.h" #include "roads.h" // #include "grader.cpp" using namespace std; #define ll long long vector<ll> minimum_closure_costs(int n, vector<int> u1, vector<int> u2, vector<int> w) { vector <ll> ans(n, 0); sort(w.rbegin(), w.rend()); ll s = 0; for(int i = n-2; i >= 0; i--) { s += (w.back()); w.pop_back(); ans[i] = s; } return ans; }
#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...