粘个代码QAQ

#include<iostream>
#include<string.h>
using namespace std;
int main()
{
	int n,sum=0;
	cin>>n;
	bool type[n+1],vis[n+1];
	int p[n+1],t[n+1];
	
	memset(vis,0,sizeof(vis));
	
	for(int i=1;i<=n;i++) 
	{
		cin>>type[i]>>p[i]>>t[i];
			
		if(type[i])
		{
			for(int j=1 ;j<i;j++)
			{
				if(type[j]||vis[j]||(p[j]<p[i])||((t[i]-t[j])>45)) continue;
				else
				{
					vis[j]=vis[i]=1;
					break;
				}
			}
			if(vis[i] == 0) sum+=p[i];
		}
		
		else sum+=p[i];
	}
	
		cout<<sum;
	 
	return 0;
 }