stl 堆栈

#include<iostream>
#include<stack>
#include<queue>
using namespace std;
int main()
{
		int n,a,b;
		
		cin>>n;
	while(n--){
	queue<int>qu;
		stack<int>st;
		char v2[101];
		char v1[101]; 
			cin>>a;
			cin>>v2;
		if(v2[0]=='F'&&v2[1]=='I'&&v2[2]=='F'&&v2[3]=='O'){
			for(int i=0;i<a;i++)
			{
				cin>>v1;
					if(v1[0]=='I'&&v1[1]=='N'){
						cin>>b;
						qu.push(b);
					}
					if(v1[0]=='O'&&v1[1]=='U'&&v1[2]=='T'){
							if(qu.empty())
							cout<<"None"<<"\n";
							else{
							cout<<qu.front()<<"\n";
							qu.pop();
					}
			}
			}
		}

		
		if(v2[0]=='F'&&v2[1]=='I'&&v2[2]=='L'&&v2[3]=='O'){
			for(int i=0;i<a;i++)
			{
						cin>>v1;
					if(v1[0]=='I'&&v1[1]=='N'){
						cin>>b;
						st.push(b);
					}
					if(v1[0]=='O'&&v1[1]=='U'&&v1[2]=='T'){
						if(st.empty())
						cout<<"None"<<"\n";
						else{
						cout<<st.top()<<"\n";
						st.pop();
						}
					
				}
			
			}
		}
	}
	return 0;
}