5차시 업로드

YIM2UL2ET/README.md

@@ -6,4 +6,5 @@
 | 2차시 | 2024.02.15 |  그리디  | [BOJ 1263](https://www.acmicpc.net/problem/1263)  | [BOJ 1449 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/7) |
 | 3차시 | 2024.02.18 |  스택  | [BOJ 2504](https://www.acmicpc.net/problem/2504)  | [BOJ 2504 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/9) |
 | 4차시 | 2024.02.21 |  덱  | [BOJ 1021](https://www.acmicpc.net/problem/1021)  | [BOJ 1021 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/12) |
+| 5차시 | 2024.02.21 |  큐  | [BOJ 1158](https://www.acmicpc.net/problem/1158)  | [BOJ 1158 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/16) |
 ---

YIM2UL2ET/큐/5차시 - BOJ 1158.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+#include <vector>
+
+int main(void)
+{
+    int size, k, idx = 0;
+    std::vector <int> v;
+
+    std::cin >> size >> k;
+    for (int i = 0; i < size;) v.push_back(++i);
+
+    std::cout << "<";
+    while(true) {
+        idx = (idx + k - 1) % size--;
+        std::cout << v[idx];
+        v.erase(v.begin() + idx);
+
+        if (size > 0) std::cout << ", ";
+        else break;
+    }
+    std::cout << ">";
+
+    return 0;
+}