야근 지수

[3] 야근 지수

#include #include #include using namespace std; long long solution(int n, vector works) { priority_queue pq(works.begin(), works.end()); for (int i = 0; i 0) { int tmp = pq.top(); pq.pop(); pq.push(tmp - 1); } } long long ans = 0; while (!pq.empty()) { ans += pow(pq.top(), 2); pq.pop(); } return ans; }