[3] 야근 지수

#include <cmath>
#include <vector>
#include <queue>
using namespace std;

long long solution(int n, vector<int> works)
{
    priority_queue<int> pq(works.begin(), works.end());

    for (int i = 0; i < n; i++)
    {
        if (pq.top() > 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;
}