diff --git "a/suyeun84/202502/11 BOJ G5 \354\260\275\354\230\201\354\235\264\354\231\200 \354\273\244\355\224\274.md" "b/suyeun84/202502/11 BOJ G5 \354\260\275\354\230\201\354\235\264\354\231\200 \354\273\244\355\224\274.md"
new file mode 100644
index 00000000..d1a1a262
--- /dev/null
+++ "b/suyeun84/202502/11 BOJ G5 \354\260\275\354\230\201\354\235\264\354\231\200 \354\273\244\355\224\274.md"	
@@ -0,0 +1,41 @@
+```java
+import java.util.*;
+import java.io.*;
+
+class Solution
+{
+	public static void main(String[] args) throws Exception{
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int N = Integer.parseInt(st.nextToken());
+        int K = Integer.parseInt(st.nextToken());
+        Integer[] coffee = new Integer[N];
+        int[] dp = new int[K+1];
+        Arrays.fill(dp, Integer.MAX_VALUE);
+        dp[0] = 0;
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < N; i++) {
+        	coffee[i] = Integer.parseInt(st.nextToken());
+        }
+        
+        Arrays.sort(coffee, Collections.reverseOrder());
+
+        for (int i = 0; i < N; i++) {
+        	if (coffee[i] > K) continue;
+        	dp[coffee[i]] = 1;
+        	for (int j = K; j > coffee[i]; j--) {
+        		if (dp[j - coffee[i]] != Integer.MAX_VALUE) {
+                    dp[j] = Math.min(dp[j], dp[j - coffee[i]] + 1);
+                }
+        	}
+        }
+        
+        if (dp[K] != Integer.MAX_VALUE) {
+    		System.out.println(dp[K]);
+    	} else {
+    		System.out.println(-1);
+    	}
+	}
+}
+
+```