2024-05-08 queuestack

Author: oesnuj

oesnuj/README.md

@@ -8,4 +8,5 @@
 | 4차시 | 2024.04.06 |  스택  | [옥상 정원 꾸미기](https://www.acmicpc.net/problem/6198)  | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/14) |
 | 5차시 | 2024.04.13 | 이분탐색  | [듣보잡](https://www.acmicpc.net/problem/1764)  | [#20](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/20) |
 | 6차시 | 2024.05.06 | 기하학  | [정사각형](https://www.acmicpc.net/problem/1485)  | [#22](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/22) |
+| 7차시 | 2024.05.08 | 스택, 큐, 덱 | [queuestack](https://www.acmicpc.net/problem/24511)  | [#24](https://github.com/AlgoLeadMe/AlgoLeadMe-10/pull/24) |
 ---

oesnuj/덱/24511.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <deque>
+#include <vector>
+using namespace std;
+
+int main()
+{
+    ios::sync_with_stdio(false); cin.tie(NULL);
+    int n;
+    cin >> n;
+    vector <int> dataStructure(n); //스텍인지 큐인지 입력받기
+    for (auto& i : dataStructure){
+        cin >> i;
+    }
+
+    deque <int> queuestack;
+    for (int i = 0; i < n; i++)
+    {
+        int x;
+        cin >> x;
+        if (dataStructure.at(i) == 0) //큐인 경우에만 처리, 스택은 무조건 입력값이 나오기에 없다고 보면됨
+            queuestack.push_back(x);
+    }
+    int m;
+    cin >> m;
+    for (int i = 0; i < m; i++)
+    {
+        int x;
+        cin >> x;
+        queuestack.push_front(x);
+        cout << queuestack.back() << " ";
+        queuestack.pop_back();
+    }
+    return 0;
+}