Merge pull request #5 from AlgoLeadMe/2-kokeunho

2-kokeunho

kokeunho/README.md

@@ -3,4 +3,5 @@
 | 차시 |    날짜    | 문제유형 | 링크 | 풀이 |
 |:----:|:---------:|:----:|:-----:|:----:|
 | 1차시 | 2024.09.28 |  구현  | [킹](https://www.acmicpc.net/problem/1063) | [#1](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/1) |
+| 2차시 | 2024.10.01 | 다이나믹 프로그래밍 | [평범한 배낭](https://www.acmicpc.net/problem/12865) | [#5] (https://github.com/AlgoLeadMe/AlgoLeadMe-12/pulls/4) |
 ---

kokeunho/다이나믹 프로그래밍/2-kokeunho.py

@@ -0,0 +1,23 @@
+N, K = map(int, input().split())
+items = []
+
+for _ in range(N):
+    W, V = map(int, input().split())
+    items.append((W, V))
+
+dp = [[0] * (K+1) for _ in range(N+1)]
+
+for i in range(1, N+1):
+    weight, value = items[i-1]
+    for j in range(1, K+1):
+        if j >= weight:
+            dp[i][j] = max(dp[i-1][j], dp[i-1][j-weight] + value)
+        else: 
+            dp[i][j] = dp[i-1][j]
+
+print(dp[N][K])
+
+
+
+
+