样例都能过 一交就保龄

#include<cstdio>
#include<algorithm>
#define N 100005

using namespace std;

int n,head,tail,ans,cnt;
int p[N],t[N],que[N];

int main(){
	scanf("%d",&n);
	for(int i=1,opt;i<=n;i++){
		scanf("%d%d%d",&opt,&p[i],&t[i]);
		if(opt){
			while(tail>=head && (45<t[i]-t[que[head]] || p[i]>p[que[head]])) head++;
			if(t[i]-t[que[head++]]>45) ans+=p[i];
		}
		else{
			ans+=p[i];
			que[++tail]=i;
		}
	}
	printf("%d",ans);
	return 0;
}