如题
代码如下```c
#include<bits/stdc++.h>
using namespace std;
struct p{
int t,m;
bool u,fs;
}a[114514];
int main(){
int n,sum=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>p[i].fs>>p[i].m>>p[i].t;
sum+=p[i].m;
if(p[i].fs==0){
int j=1;
if(i>45){
j=i-45;
}
for(j;j<i;j++){
if(p[j].u==0&&p[j].t-p[i].t<=45&&p[j].m<=p[i].m&&p[i].fs==1){
p[i].u=1;
sum=sum-p[i].m;
break;
}
}
}
}
cout<<sum;
return 0;
}
