一道站外题~~~~但不完全~~~~

#include <bits/stdc++.h>
using namespace std;
int n;
struct node{
	bool isbos;
	int m=-114514;
}t[10000009];
int main(){
	//freopen("transfer.in","r",stdin);
	//freopen("transfer.out","w",stdout);
	cin>>n;
	int sum=0;
	int ti,money;
	bool f;
    int i;
    int j;
	for(i=1;i<=n;i++){
		cin>>f>>money>>ti;
		t[ti].isbos=f;
		t[ti].m=money;
		sum+=money;
		if(f){
			for(j=max(0,ti-45);j<ti;j++){
				if(t[j].m==-114514){
					continue;
				}
				if(t[j].isbos)continue;
				if(t[j].m<money)continue;
				t[j].isbos=1;
				sum-=money;
			}
		}
	}
	cout<<sum;
	//fclose(stdin);
	//fclose(stdout);
	return 0;
}

自己算的是48KB