Submission #74539689

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define mrep(i,n) for (int i = 1; i <= (n); i++)
#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define pb push_back
#define pob pop_back

int main() {
  int q;
  cin >> q;
  priority_queue<ll, vector<ll>, greater<ll>> pq;

  rep(qi,q) {
    ll t, h;
    cin >> t >> h;
    if(t == 1) {
      pq.push(h);
    } else {
      while(!pq.empty() && pq.top() <= h) pq.pop();
    }
    cout << pq.size() << "\n";
  }
}

Submission Info

Judge Result