样例2没过样例一过了

#include<bits/stdc++.h>
#define int long long
using namespace std;
struct node
{
	long long qian,shi;
};
int a[200010],b[200010],t[100010];
vector<node> vec;
long long s[200010],ans=0;
signed main()
{
	int n;
	int head=0;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		int tie=vec.size();
		cin>>t[i]>>a[i]>>b[i];
		if(t[i]==0)
		{
			vec.push_back({a[i],b[i]+45});
			tie=vec.size();
			ans+=a[i];
		}
		else
		{
			
			while(vec[head].shi>=b[i])
			{
				head++;
				tie++;
			}
			bool flag=false;
			for(int j=head;j<=tie;j++)
			{
				if(vec[j].qian>=a[i])
				{
					vec[j].qian=0;
					vec[j].shi=0;
					flag=true;
					break;
				}
			}
			if(flag==false)
			{
				ans+=a[i];
			}
		}
		/*
		for(int j=head;j<tie;j++)
		{
			cout<<vec[j].qian<<" "<<vec[j].shi<<endl;
		}
		cout<<"__________"<<ans<<endl;
		*/
	}
	cout<<ans;
	
	return 0;
}