Submission #74565062

---

Source Code Expand

#include<bits/stdc++.h>
// #include<atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, n) for(int  i = 0; i < (n); ++i)
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
const long long INF = 1LL << 60;
using Graph = vector<vector<int>>;
int gcd(int a, int b){
    if(b == 0) return a;  
    else return gcd(b, a%b);
}
struct Compare {
    bool operator()(const pair<ll, int>& a, const pair<ll, int>& b) {
        return a.first > b.first;  
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int q; cin >> q;
    priority_queue<int, vector<int>, greater<int>> pq;
    while(q--){
        int t; cin >> t;
        if(t == 1){
            int h; cin >> h;
            pq.push(h);
        }else{
            int h; cin >> h;
            while(!pq.empty() && pq.top() <= h){
                pq.pop();
            }
        }
        cout << pq.size() << endl;
    }
}

Submission Info

Judge Result