Submission #74549484

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include<deque>
#include<cstring>
#include<map>
#include<set>
#include<cctype>
#include<iomanip>
#include<cmath>
#include<queue>
#include<climits>
#include<numeric>
#include<unordered_set>
#include<stack>
using namespace std;
#define DEBUG(x) cerr<< #x <<' = '<< x <<endl
#define ll long long 
#define all(a) a.begin(),a.end()
#define pb push_back
#define pll pair<ll,ll>
#define unset unordered_set
ll gcd(ll a, ll b) {
    if (b == 0)return a;
    return gcd(b, a % b);
}

void solve() {
    int q;
    cin >> q;
    priority_queue<int,vector<int>,greater<int>>qu;
    while (q--) {
        int op, h;
        cin >> op >> h;
        if (op == 1)qu.push(h);
        else {
            while (!qu.empty() and qu.top() <= h)qu.pop();
        }
        if (qu.empty())cout << "0\n";
        else cout << qu.size() << endl;
    }

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T = 1;
    //cin >> T;
    while (T--)
        solve();
    return 0;
}

Submission Info

Judge Result