feat: 3월 2주차 과제 문제 답

Author: YoonYn9915

_WeeklyChallenges/W14-[DP]/Assignment_BOJ_2294_동전 2.py

@@ -0,0 +1,21 @@
+'''
+BOJ #2294. 동전 2 (골드 5)
+https://www.acmicpc.net/problem/2294
+유형: DP
+'''
+
+
+for _ in range(n):
+    arr.append(int(input()))
+
+dp = [100001 for i in range(k + 1)]
+dp[0] = 0
+
+for coin in arr:
+    for i in range(coin, k + 1):  
+        dp[i] = min(dp[i], dp[i - coin] + 1)
+
+if dp[k] == 100001:
+    print(-1)
+else:
+    print(dp[k])