50分求调，必关

#include<cstdio>
using namespace std;
int n,l,mony,p,a,cnt,k;
struct node{
	int x,mon,t;
}q[100005];
int main(){
	node a[100005];
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d%d%d",&q[i].x,&q[i].mon,&q[i].t);
	for(int i=1;i<=n;i++){
		k=0;
		if(q[i].x==0){
			cnt++;
			a[cnt].mon=q[i].mon;
			a[cnt].t=q[i].t;
			mony+=q[i].mon;
		}else{
			for(int j=1;j<=cnt;j++){
				if(q[i].mon<=a[j].mon&&a[j].mon!=-1e9&&q[i].t-a[j].t<=45){
					k=1;a[j].mon=-1e9;
					break;
				}
			}
			if(k==1)continue;
			mony+=q[i].mon;
		}
	}
	printf("%d",mony);
	return 0;
}