蒟蒻____

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
#define int long long
int allw[1000005], allt[1000005];
void solve() {
	int n, k;
	cin >> n;
	set<pii> s1, s2;
	for (int i = 1; i <= n; i ++) {
		int op;
		scanf("%lld", & op);
		if (op == 1) {
			int w, t;
			// cin >> w >> t;
			scanf("%lld%lld", & w, & t);
			if (allt[t] || allw[w]) {
				continue;
			}
			allt[t] = 1;
			allw[w] = 1;
			s1.insert({w, t});
			s2.insert({t, w});
		}
		else if (op == 2) {
			auto te = s1.begin();
			
			auto p = *te;
			allw[p.fi] = allt[p.se] = 0;
			swap(p.fi, p.se);
			
 			s1.erase(te);
			s2.erase(p);
		}
		else {
			auto te = s2.begin();
			
			auto p = *te;
			swap(p.fi, p.se);
			allw[p.fi] = allt[p.se] = 0;
			s2.erase(te);
			s1.erase(p);
		}
		
	}
	int ans = 0;
	for (auto t : s1)
		ans += t.fi;
	cout << ans << endl;
	
}
signed main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

修改后注意维护allw，allt