提出 #27805690

---

ソースコード 拡げる

# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define int long long
# define fi first
# define se second

using namespace std;

const int N = 2e5 + 7;
const int mod = 1e9 + 7;
const int INF = 1e18 + 7;

int A[N], B[N], C[N], D[N];

int32_t main() {
   speed;
   int n;
   cin >> n;
   multiset < int > st, st2;
   deque < int > q;
   int sz = 0, rem = 0;
   for ( int i = 1; i <= n; i++ ) {
      int t;
      cin >> t;
      if ( t == 1 ) {
         int x;
         cin >> x;
         q.push_back(x);
         st2.insert(x);
         sz++;
      }
      else if ( t == 2 ) {
         if (rem == 0) {
            int x = q.front();
            cout << x << '\n';
            sz--;
            st2.erase(st2.find(x));
            q.pop_front();
         }
         else {
            int x = *st.begin();
            cout << x << '\n';
            st.erase(st.begin());
            st2.erase(st2.find(x));
            rem--;
            sz--;
         }
      }
      else {
         rem = sz;
         q.clear();
         st = st2;
      }
   }
}

提出情報

ジャッジ結果