uploaded at 2022. 12. 31. 오전 2:57:40

programmers/디펜스 게임/solution.java

@@ -0,0 +1,29 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/142085
+
+import java.util.PriorityQueue;
+class Solution {
+    public int solution(int n, int k, int[] enemy) {
+        int answer = 0, min = enemy[0]; // k = defence
+        PriorityQueue<Integer> pq = new PriorityQueue<>();
+        for(int a = 0; a < Math.min(k,enemy.length); a++) {
+            pq.add(enemy[a]);
+            answer++;
+        }
+        for(int a = k; a < enemy.length; a++){
+            if(n==0) break;
+            if(enemy[a]>pq.peek()){
+                if(n >= pq.peek()){
+                    n -= pq.poll();
+                    pq.add(enemy[a]);
+                    answer++;
+                    continue;
+                } else break;
+            }
+            if(n >= enemy[a]){
+                n -= enemy[a];
+                answer++;
+            } else break;
+        }
+        return answer;
+    }
+}