프로그래머스 디펜스 게임 (JAVA)

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

프로그래머스

 

 

import java.util.*;

class Solution {
    public int solution(int n, int k, int[] enemy) {
        int answer = 0;
        int cnt = 0;
        PriorityQueue<Integer> pq = new PriorityQueue<Integer>(Collections.reverseOrder());
        int sum = 0;
        for(int num : enemy){
            answer++;
            pq.offer(num);
            sum += num;
            if(sum > n && cnt < k){
                int temp = pq.poll();
                sum -= temp;
                cnt++;
                continue;
            }
            if(sum > n){
                answer--;
                break;
            }
        }
        return answer;
    }
}