RE记录

#include<iostream>
#include<vector>
#include<queue>
using namespace std;
queue<int>qq;
vector<int>st;
priority_queue<int,vector<int>,greater<int> >qx;
priority_queue<int>qd;

int n,op,m,q=1,s=1,d=1,x=1;
int main(){
scanf("%d",&n);
while(n--){
	scanf("%d %d",&op,&m);
	if(op==1){
		if(q){qq.push(m);}
		if(s){st.push_back(m);}
		if(d){qd.push(m);}
		if(x){qx.push(m);}
	}
	if(op==2){
		if((qq.empty() || qq.front()!=m) && q){q=0;}
		else{qq.pop();}
		if((st.empty() || st.back()!=m) && s){s=0;}
		else{st.pop_back();}
		if((qd.empty() || qd.top()!=m) && d){d=0;}
		else{qd.pop();}
		if((qx.empty() || qx.top()!=m) && x){x=0;}
		else{qx.pop();}
	}
}
if(q){printf("Yes\n");}
else{printf("No\n");}
if(s){printf("Yes\n");}
else{printf("No\n");}
if(d){printf("Yes\n");}
else{printf("No\n");}
if(x){printf("Yes");}
else{printf("No");}
return/*结束*/0;
}

神犇们帮忙看看吧QAQ