前7个过了，后面全TLE，不会队列QAQ

#include<iostream>
using namespace std;

struct ticket
{
	int price;
	int time;
	bool type;
	bool isuse;
};

int main()
{
	int n, sumcost=0;
 	cin >> n;
	ticket arr[n];
	for (int i=1; i<=n; i++)
	{
		cin >> arr[i-1].type >> arr[i-1].price >> arr[i-1].time;
		arr[i-1].isuse=arr[i-1].type;
	}
	for (int i=1; i<=n; i++)
		if (!arr[i-1].type)
			sumcost+=arr[i-1].price;
		else
		{
			bool isfind=0;
			for (int j=1; j<i; j++)
				if (!arr[j-1].isuse && arr[j-1].price>=arr[i-1].price && arr[i-1].time-arr[j-1].time<=45)
				{
					arr[j-1].isuse=1;
					isfind=1;
					break;
				}
			if (!isfind) sumcost+=arr[i-1].price;
		}
	cout << sumcost;
	return 0;
}