feat : 2025-08-14 programmers lv.3 question solved.

Author: Hojip-Kim

2025-08-14/김호집/디펜스게임.java

@@ -0,0 +1,33 @@
+import java.util.*;
+class Solution {
+    public int solution(int n, int k, int[] enemy) {
+        int answer = 0;
+        if(k >= enemy.length){
+            return enemy.length;
+        }
+
+        PriorityQueue<Integer> pq = new PriorityQueue<>();
+
+        for(int elem : enemy){
+            if(k > 0){
+                k--;
+                pq.offer(elem);
+            }else{
+                int num = pq.poll();
+                if(num < elem){
+                    pq.offer(elem);
+                    n-=num;
+                }else{
+                    n-=elem;
+                    pq.offer(num);
+                }
+                if(n < 0){
+                    break;
+                }
+            }
+            answer++;
+        }
+
+        return answer;
+    }
+}

2025-08-14/김호집/모음사전.java

@@ -0,0 +1,18 @@
+import java.util.*;
+
+class Solution {
+    public int solution(String word) {
+        int[] weight = {781, 156, 31, 6, 1};
+
+        Map<Character, Integer> indexMap = Map.of(
+                'A', 0, 'E', 1, 'I', 2, 'O', 3, 'U', 4
+        );
+
+        int ans = 0;
+        for (int i = 0; i < word.length(); i++) {
+            ans += indexMap.get(word.charAt(i)) * weight[i];
+        }
+        ans += word.length();
+        return ans;
+    }
+}

2025-08-14/김호집/점찍기.java

@@ -0,0 +1,12 @@
+import java.util.*;
+class Solution {
+    public long solution(int k, int d) {
+        long answer = 0;
+
+        for(int i = 0; i <= d; i = i + k) {
+            long x = (long) Math.sqrt(Math.pow(d, 2) - Math.pow(i, 2));
+            answer+= (long)x/k + 1;
+        }
+        return answer;
+    }
+}