[백준] 10845. 큐(c++)

https://www.acmicpc.net/problem/10845

stl을 써서 요구사항에 맞게 구현해주기만 하면 된다.

 

---

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
#include <cstring>
#include <deque>
#include <climits>
#include <set>
#include <stack>
using namespace std;

using ll = long long;

int main() {
	
	int n;
	queue<int> q;

	cin >> n;

	while (n--) {
		string temp;

		cin >> temp;

		if (temp == "push") {
			int push_int;
			cin >> push_int;
			q.push(push_int);
		}
		else if (temp == "pop") {
			if (q.empty()) {
				cout << "-1\n";
				continue;
			}
			cout << q.front() << '\n';
			q.pop();
		}
		else if (temp == "size") {
			cout << q.size() << '\n';
		}
		else if (temp == "empty") {
			if (q.empty()) {
				cout << "1\n";
			}
			else
				cout << "0\n";
		}
		else if (temp == "front") {
			if (q.empty()) {
				cout << "-1\n";
				continue;
			}
			cout << q.front() << '\n';

		}
		else if (temp == "back") {
			if (q.empty()) {
				cout << "-1\n";
				continue;
			}
			cout << q.back() << '\n';

		}
	}

	
	return 0;
}