#include<bits/stdc++.h>
using namespace std;
int n,use=0,sum=0;
struct node
{
       int x,money,time;	
};
deque<node>q;
int main(){
	//freopen("P5661_1.in","r",stdin);
	//freopen("text.txt","w",stdout);
	cin>>n;
	for(int i=0;i<n;i++)
	{
		node ans;
		use=0;
		cin>>ans.x>>ans.money>>ans.time;
		if(ans.x==0)q.push_back(ans),sum+=ans.money;
		else if(ans.x==1)
		{
			for(int j=0;j<q.size();j++)
			{
				if(ans.time-q[j].time>45){q.erase(q.begin()+j);}
				else if(q[j].money>=ans.money){q.erase(q.begin()+j),use=1;break;}
			}
			if(use==0){sum+=ans.money;}
			else cout<<"use\n";
		}
		for(int k=0;k<q.size();k++)
		{
			cout<<"q:"<<q[k].x<<" "<<q[k].money<<" "<<q[k].time<<endl;
		}
		cout<<"sum:"<<sum<<"\n";
	}
	cout<<sum;
	return 0;
} 

话说两天都没写出来这题CSP-J是不是可以爆0预告了