feat: 1106풀이, 문제추천

Author: hyoinYang

2주차 Knapsack/README.md

@@ -134,7 +134,7 @@ $$
 
 | 난이도 | 번호 | 제목 | 링크               |
 | ------ | ---- | ---- | ------------------ |
-| ![??]  | -    | -    | <https://boj.kr/-> |
+| ![S2]  | 12867 | n차원 여행 | <https://boj.kr/12867> |
 
 <!-- solved.ac 문제 난이도 별 태그 이미지 -->
 

2주차 Knapsack/양효인/1106.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+using namespace std;
+
+int c, n;
+int input[20][2];
+int dp[100001];
+
+int countDP(int customer, int cityNum) {
+	int min = 100 * 1000;
+	int cost;
+	if (customer <= 0) return 0;
+	else if (dp[customer] > 0) return dp[customer];
+	else {
+		for (int i = 0; i < cityNum; i++) {
+			cost = countDP(customer - input[i][1], cityNum) + input[i][0];
+			min = cost < min ? cost : min;
+		}
+		dp[customer] = min;
+		return min;
+	}
+}
+
+int main() {
+	ios::sync_with_stdio(false);
+	cin.tie(0); cout.tie(0);
+
+	cin >> c >> n;
+	for (int i = 0; i < n; i++) {
+		int a, b;
+		cin >> a >> b;
+		input[i][0] = a;
+		input[i][1] = b;
+	}
+
+	cout << countDP(c, n);
+
+	return 0;
+
+}