BOJ 18258 - 큐 2 [C++]

문제

링크

풀이

#include <iostream>
#include <queue>
#include <string>
using namespace std;
 
void solve(void) {
  int n, x;
  cin >> n;
  queue<int> q;
 
  string s;
  for (int i=0; i<n; i++) {
    cin >> s;
    if (s == "push") {
      cin >> x;
      q.push(x);
    } else if (s == "pop") {
      if (q.empty()) {
        cout << "-1\n";
        continue;
      }
      cout << q.front() << "\n";
      q.pop();
    } else if (s == "size") {
      cout << q.size() << "\n";
    } else if (s == "empty") {
      cout << q.empty() << "\n";
    } else if (s == "front") {
      if (q.empty()) {
        cout << "-1\n";
        continue;
      }
      cout << q.front() << "\n";
    } else if (s == "back") {
      if (q.empty()) {
        cout << "-1\n";
        continue;
      }
      cout << q.back() << "\n";
    }
  }
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}