Submission #39854585

---

Source Code Expand

#include <iostream>
#include <set>

using namespace std;

int main() {
    int N, Q;
    cin >> N >> Q;
    set<int> waiting;
    set<int> called;
    
    for (int i = 0; i < N; i++) {
        waiting.insert(i);
    }
    
    for (int q = 0; q < Q; q++) {
        int type;
        cin >> type;
        if (type == 1) {
            int k = *waiting.begin();
            called.insert(k);
            waiting.erase(k);
        } else if (type == 2) {
            int x;
            cin >> x;
            x--;
            called.erase(x);
        } else {
            cout << *called.begin() + 1 << '\n';
        }
    }
}

Submission Info

Judge Result