Submission #28096624

---

Source Code Expand

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = 3.14159265359;
const ll INF = 1LL << 60;

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

  queue<int> que1;
  priority_queue<int, vector<int>, greater<int>> que2;
  
  for (int i = 0; i < q; i++){
    int t, x;
    cin >> t;
    switch (t){
    case 1:
      cin >> x;
      que1.push(x);
      break;
    case 2:
      if (que2.size() == 0){
	cout << que1.front() << endl;
	que1.pop();
      } else {
	cout << que2.top() << endl;
	que2.pop();
      }
      break;
    default:
      while (que1.size() > 0){
	que2.push(que1.front());
	que1.pop();
      }
    }
  }
  
  return 0;
}

Submission Info

Judge Result