WA90求救

#include <bits/stdc++.h>
#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

namespace Splay {
	const int maxn = 1e5 + 10;

	struct Node {
		int val, cnt, p;
		int s[2], sz;
		void init(int _val, int _p) { val = _val; p = _p; cnt = sz = 1; }
	} tree[maxn];

	int root = 0, idx = 0;

	void push_up(int i) { tree[i].sz = tree[tree[i].s[0]].sz + tree[tree[i].s[1]].sz + tree[i].cnt; }

	void rotate(int x) {
		int y = tree[x].p, z = tree[y].p;
		int k = (tree[y].s[1] == x);
		tree[z].s[tree[z].s[1] == y] = x, tree[x].p = z;
		tree[y].s[k] = tree[x].s[k ^ 1], tree[tree[x].s[k ^ 1]].p = y;
		tree[x].s[k ^ 1] = y, tree[y].p = x;
		push_up(y); push_up(x);
	}

	void splay(int x, int k) {
		while (tree[x].p != k) {
			int y = tree[x].p, z = tree[y].p;
			if (z != k) {
				if ((tree[y].s[1] == x) ^ (tree[z].s[1] == y)) rotate(x);
				else rotate(y);
			}
			rotate(x);
		}
		if (k == 0) root = x;
	}

	void find(int val) {
		int u = root;
		while (tree[u].s[val > tree[u].val] && val != tree[u].val)
			u = tree[u].s[val > tree[u].val];
		splay(u, 0);
	}

	int prev(int val) {
		find(val);
		if (tree[root].val < val) return root;
		int u = tree[root].s[0];
		while (tree[u].s[1]) u = tree[u].s[1];
		return u;
	}

	int next(int val) {
		find(val);
		if (tree[root].val > val) return root;
		int u = tree[root].s[1];
		while (tree[u].s[0]) u = tree[u].s[0];
		return u;
	}

	void insert(int val) {
		int u = root, p = 0;
		while (u != 0 && tree[u].val != val) {
			p = u;
			u = tree[u].s[val > tree[u].val];
		}
		if (u == 0) {
			u = ++idx;
			if (p != 0) tree[p].s[val > tree[p].val] = u;
			tree[u].init(val, p);
		}
		else tree[u].cnt++;
		splay(u, 0);
	}

	void remove(int val) {
		int pre = prev(val);
		int nxt = next(val);
		splay(pre, 0); splay(nxt, pre);

		int x = tree[nxt].s[0];
		if (tree[x].cnt > 1) {
			--tree[x].cnt;
			splay(x, 0);
		}
		else tree[nxt].s[0] = 0;
	}

	int remove_less_than(int val) {
		int l = 1, r = next(val - 1);
		splay(l, 0); splay(r, l);
		
		int ret = tree[tree[r].s[0]].sz;
		tree[r].s[0] = 0;
		push_up(r); push_up(l);
		return ret;
	}

	int get_rank(int val) {
		find(val);
		return tree[tree[root].s[0]].sz;
	}

	int get_kth(int k) {
		++k;
		int u = root;
		while (true) {
			if (tree[tree[u].s[0]].sz >= k) u = tree[u].s[0];
			else if (tree[tree[u].s[0]].sz + tree[u].cnt < k)
				k -= tree[tree[u].s[0]].sz + tree[u].cnt, u = tree[u].s[1];
			else return u;
		}
		return -1;
	}

	inline int get_kth_max(int k) {
		if (k > tree[root].sz - 2) return -1;
		return get_kth(tree[root].sz - k - 1);
	}

	inline int get_val(int x) { return tree[x].val; }

	inline void init() { insert(INT_MIN); insert(INT_MAX); }

}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	// ifstream in("P1486_5.in");
	// ofstream out("my_P1486_5.out");
	// #define cin in
	// #define cout out
	
	Splay::init();

	int n, mn;
	cin >> n >> mn;

	int delta = 0, ans = 0;
	for (int i = 0; i < n; i++) {
		char opt; int k; cin >> opt >> k;
		if (opt == 'I') {
			if (k < mn) continue;
			Splay::insert(k - delta);
		}
		else if (opt == 'A') delta += k;
		else if (opt == 'S') {
			delta -= k;
			ans += Splay::remove_less_than(mn - delta);
		}
		else if (opt == 'F') {
			int ix = Splay::get_kth_max(k);
			if (ix < 0) cout << -1 << endl;
			else cout << Splay::get_val(ix) + delta << endl;
		}
	}
	cout << ans << endl;
	return 0;
}