没开O2优化前 代码如下，顺便问一下csp比赛能用O2优化吗，感谢大佬

#include <queue>
#include <cstdio>

using namespace std;

typedef struct{
	int p,t;	
}piao;

queue<piao> q;

int main(){
	int n,sum=0;
	scanf("%d",&n);
	for(int i = 1; i <= n; i++){
		int b_s;
		piao a;
		scanf("%d%d%d",&b_s,&a.p,&a.t);
		sum+=a.p;
		if(!b_s)q.push(a);
		else if(!q.empty()){
			int ok = 1;
			int len = q.size();
			for(int i = 1; i <= len; i++){
				piao b = q.front();
				if(a.t-b.t<=45&&a.t-b.t>=1&&a.p<=b.p&&ok){
					sum-=a.p;
					ok=0;
				}
				else q.push(b);
				q.pop();
			}
		}
	}
	printf("%d",sum);
	return 0;
}