Quartz sync: Nov 25, 2025, 6:36 PM

Author: codeyoma

content/About.md

@@ -2,7 +2,7 @@
 aliases:
 description: 
 created: 2025-05-18
-modified: 2025-08-14
+modified: 2025-11-25
 title: About
 comments: "true"
 ---
@@ -23,5 +23,7 @@ comments: "true"
 - [Sweep Keyboard](https://github.com/codeyoma/sweep-nice-nano)
 - [Yòmá's Library](https://lib.yoma.kr/)
 
+<!--
 ### Badge
 [![Yoma's Solved.ac profile](http://mazassumnida.wtf/api/v2/generate_badge?boj=hiatus4322)](https://solved.ac/profile/hiatus4322)
+-->

content/Computer Science/1 Foundations & Theory/Algorithms/ps/boj/1162/1162.md

@@ -0,0 +1,132 @@
+---
+tags: ["ps/boj/gold/4", "ps/boj/gold", "cs/algorithms/bruteforcing/ps","cs/algorithms/backtracking/ps"]
+---
+
+# Problem
+- [https://www.acmicpc.net/problem/19942](https://www.acmicpc.net/problem/19942)
+- [code on boj](https://www.acmicpc.net/status?problem_id=19942&user_id=hiatus4322)
+- [code on github](https://github.com/codeyoma/ps/tree/main/boj/19942)
+
+
+<br/>
+
+<!--
+# Logic
+
+### *분석*
+- 문제 유형 (알고리즘...)
+- 제약 조건 (인풋 크기, 예외 값, 시공간 복잡도...)
+
+### *설계*
+1. 알고리즘 선택
+2. 자료구조 선택
+3. 수도 코드 작성
+4. 정합판단
+  - `1 ~ 3`과정으로 도출된 로직이 문제를 해결하는가
+    - 그렇다 -> **구현**
+    - 잘 모르겠다 -> **구현**
+    - 아니다 -> 1번부터 다시 점검
+
+### *구현*
+- 로직 검증
+
+### *테스트*
+- 예외 케이스 고려
+
+<br/>
+
+-->
+
+# My Code
+
+## cpp
+```cpp title="boj/19942.cpp"
+// https://www.acmicpc.net/problem/19942
+#include <iostream>
+using namespace std;
+
+#ifdef LOCAL
+#    define LOG clog
+#else
+struct nullstream : ostream {
+    nullstream()
+        : ostream(nullptr) {}
+};
+nullstream LOG;
+#endif
+
+void fast_io() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+}
+
+//--------------------------------------------------------------------------------------------------
+
+#define MAX (1234567891)
+#define MIN (-1234567891)
+#include <vector>
+
+using namespace std;
+
+int         N;
+int         Con[4];
+int         Ing[15][5];
+int         minPrice = 15 * 500;
+vector<int> bestChoice;
+
+void backtracking(int sum[5], vector<int> choice, int idx) {
+    for (int i = 0; i < 4; i++) {
+        if (sum[i] < Con[i]) {
+            return;
+        }
+    }
+    if (minPrice > sum[4] || (minPrice == sum[4] && choice < bestChoice)) {
+        minPrice   = sum[4];
+        bestChoice = choice;
+    }
+    for (int i = idx; i < N; i++) {
+        int         newsum[5];
+        vector<int> newchoice = choice;
+        memcpy(newsum, sum, sizeof(int) * 5);
+        newchoice.push_back(i + 1);
+        for (int j = 0; j < 5; j++) {
+            newsum[j] -= Ing[i][j];
+        }
+        backtracking(newsum, newchoice, i + 1);
+    }
+}
+
+int main() {
+    fast_io();
+    int sum[5] = {
+        0,
+    };
+
+    cin >> N;
+
+    for (int i = 0; i < 4; i++) {
+        cin >> Con[i];
+    }
+
+    for (int i = 0; i < N; i++) {
+        for (int j = 0; j < 5; j++) {
+            int input;
+            cin >> input;
+            Ing[i][j] = input;
+            sum[j] += input;
+        }
+    }
+    vector<int> choice;
+
+    backtracking(sum, choice, 0);
+    cout << minPrice << "\n";
+    int idx = 0;
+    for (int i = 1; i <= N; i++) {
+        if (idx < bestChoice.size() && i == bestChoice[idx]) {
+            idx++;
+        } else {
+            cout << i << " ";
+        }
+    }
+}
+```