提出 #74521856

---

ソースコード 拡げる

#include<iostream>
#include<string>
#include<string.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<math.h>
#include<cmath>
#include<stack>
#include<set>
#include<climits>
#include<map>
#include<queue>
#include<deque>
using namespace std;
#define endl '\n'
#define ll long long
#define PII pair<ll,ll>
#define all(x) x.begin(),x.end()
const int N = 1e6 + 50;
const ll INF = 0x3f3f3f3f3f3f3f3fLL;
const ll MOD = 1e9 + 7;

ll gcd(ll a,ll b){
    return b?gcd(b,a%b):a;
}

ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}

ll qpow(ll a, ll b, ll mod) {
	ll res = 1;
	while (b > 0) {
		if (b & 1)res = res * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return res;
}

ll bit(ll a) {
	if (a <= 0) return 1;
	ll cnt = 0;
	while (a) {
		cnt++;
		a >>= 1;
	}
	return cnt;
}

void solve() {
	ll n;
	cin >> n;
	multiset<ll>st;
	for (int i = 1; i <= n; i++) {
		ll x, y;
		cin >> x >> y;
		if(x == 1){
			st.insert(y);
		}else{
			auto u = st.begin();
			while(u != st.end() && *u <= y){
				u = st.erase(u);
			}
		}
		cout << st.size() << endl;
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	ll t = 1;
	//cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}

提出情報

ジャッジ結果