1-rivkms

rivkms/DP/12865.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+
+int main(){
+    int n, k;
+    cin >> n >> k;
+    vector<pair<int, int>> wv(n+1, pair<int, int>(0,0));
+    vector<vector<int>> value (n+1, vector<int>(k+1, 0));
+    for(int i = 1; i<=n; i++){
+        cin >> wv[i].first >> wv[i].second;        
+    }
+
+    for(int i = 1; i<=n; i++){
+        for(int j = 1; j<=k;j++){
+            if(wv[i].first > j ){
+                value[i][j] = value[i-1][j];
+            }
+            else{
+                value[i][j] = max(value[i-1][j], value[i-1][j-wv[i].first]+wv[i].second);
+            }
+
+        }
+    }
+    cout << value[n][k];
+
+    return 0;
+}

rivkms/README.md

@@ -2,5 +2,5 @@
 
 | 차시 |    날짜    | 문제유형 | 링크 | 풀이 |
 |:----:|:---------:|:----:|:-----:|:----:|
-| 1차시 | 2023.10.27 |  BFS  | -  | - |
+| 1차시 | 2024.02.12 |  DP  | [평범한 배낭](https://www.acmicpc.net/problem/12865)  | [#1](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/5) |
 ---