都在上图里

#include<bits/stdc++.h>
using namespace std;
struct Ticket{
    int pri;
    int tim;
}UndG[100009];
int main(){
    int n,ans=0,l=0,r=0;
    cin>>n;
    for(int i=1;i<=n;i++){
        int ty,pr,ti;
        cin>>ty>>pr>>ti;
        if(ty==0){
            ans+=pr;
            UndG[i].pri=pr;
            UndG[i].tim=ti;
            r=i;
        }
        else{
            bool Free=false;
            for(int u=l;u<=r;u++){
                if(ti-UndG[u].tim<=45&&pr<=UndG[u].pri){
                    l=u+1;
                    Free=true;
                    break;
                }
            }
            if(Free){

            }
            else{
                ans+=pr;
            }
        }
    }
    cout<<ans;
    return 0;
}