프로그래머스 Lv3. 야근 지수 풀이

https://school.programmers.co.kr/learn/courses/30/lessons/12927

프로그래머스

 

 

자바

import java.util.PriorityQueue;
import java.util.Collections;

class Solution {
    public long solution(int n, int[] works) {
        long answer = 0;
        
        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());
        
        for(int work:works)
        {
            pq.offer(work);
        }
        
        for(int i = 0; i < n; i++)
        {

            //이렇게 if 처리 안하면 런타임 에러 발생
            if(!pq.isEmpty())
            {
                int max = pq.poll();
            
                if(max > 0)
                {
                    max-=1;        
                    pq.offer(max);
                }
            }
            
            else
            {
                break;
            }
        }
        
        while(!pq.isEmpty())
        {
            int yageun = pq.poll();
            answer += (long) yageun * yageun;
        }
        
        return answer;
    }
}