Algorithm/boj10845.cpp at master · mj-sep/Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include<iostream>
#include<queue>
using namespace std;

queue<int> q;

// queue-push
void push(int x) {
	q.push(x);
}

// queue-push 제외
void f_queue(string x) {
	if (x == "pop") {
		if (q.empty()) cout << "-1\n";
		else {
			cout << q.front() << "\n";
			q.pop();
		}
	}
	else if (x == "size") {
		cout << q.size() << "\n";
	}
	else if (x == "empty") {
		if (q.empty()) cout << "1\n";
		else cout << "0\n";
	}
	else if (x == "front") {
		if (q.empty()) cout << "-1\n";
		else cout << q.front() << "\n";
	}
	else if (x == "back") {
		if (q.empty()) cout << "-1\n";
		else cout << q.back() << "\n";
	}

}

int main() {
	int n;
	cin >> n;

	for (int i = 0; i < n; i++) {
		string quest;
		cin >> quest;

		if (quest == "push") {
			int n2;
			cin >> n2;
			push(n2);
		}
		else
			f_queue(quest);
	}
}