样例不过求调

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,to[N],pr[N],t[N],ans;
int ticket[N],cnt=1;
int main()
{
	cin>>n;
	memset(ticket,-1,N);
	for(int i=1;i<=n;i++)
	{
		cin>>to[i]>>pr[i]>>t[i];
		if(to==0)
		{
			ans+=pr[i];
			ticket[i]=pr[i];
//			cout<<ans<<endl;
		}
		else
		{
			for(int j=cnt;j<=i;j++)
			{
				if(ticket[j]>=pr[i] && t[i]-t[j]<=45)
				{
					ticket[j]=-1;
					break;
				}
				else if(t[i]-t[j]>45)
				{
					cnt=i;
					ans+=pr[i];
//					cout<<ans<<endl;
					break;
				}
				else
				{
					ans+=pr[i];
//					cout<<ans<<endl;
					break;
				}
			}
		}
	}
	cout<<ans;
	return 0;
}