ACboy was kidnapped

ACboy was kidnapped!!
he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor 
As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can't solve my problems, you will die with ACboy."
The problems of the monster is shown on the wall:
Each problem's first line is a integer N(the number of commands), and a word "FIFO" or "FILO".(you are very hapapy because you know "FIFO" stands for "First In First Out", and "FILO" means "First In Last Out").
and the following N lines, each line is "IN M" or "OUT", (M represent a integer).
and the answer of a problem is a passowrd of a door, so if you want to rescue ACboy, answer the problem carefully!

Input

The input contains multiple test cases.
The first line has one integer,represent the number oftest cases.
And the input of each subproblem are described above.

Output

For each command "OUT", you should output a integer depend on the word is "FIFO" or "FILO", or a word "None" if you don't have any integer.
Sample Input
4
4 FIFO
IN 1
IN 2
OUT
OUT
4 FILO
IN 1
IN 2
OUT
OUT
5 FIFO
IN 1
IN 2
OUT
OUT
OUT
5 FILO
IN 1
IN 2
OUT
IN 3
OUT
Sample Output
1
2
2
1
1
2
None
2
3

代码如下：（过不了关但是可以提供思路） （AC代码在下面）

#include<bits/stdc++.h>//万能头文件
#include<iostream>//过vj用下列头文件 
#include<stack>
#include<queue>
using namespace std;
int main() {
	stack<int> v;//栈 先进后出->FILO
	queue<int> u;//队列 先进先出->FIFO
	int n;
	cin>>n;
	while(n--) {
		int t;
		string a;
		cin>>t>>a;
		if(a=="FIFO") { //当为FIFO时 使用queue 命名为u
			while(t--) {
				string ch;
				cin>>ch;
				if(ch=="IN") { //"IN"为插入
					int x;
					cin>>x;
					u.push(x);
				}
				if(ch=="OUT") { //"OUT"为输出
					if(u.empty()) cout<<"None"<<endl;//判定是否为空
					else {
						cout<<u.front()<<endl;//注意队列队头的输出为front
						u.pop();//队头出队
					}
				}
			}
		}
		if(a=="FILO") { //当为FIFO时 使用stack 命名为v
			while(t--) {
				string ch;
				cin>>ch;
				if(ch=="IN") { //"IN"为插入
					int x;
					cin>>x;
					v.push(x);
				}
				if(ch=="OUT") { //"OUT"为输出
					if(v.empty()) cout<<"None"<<endl;
					else {
						cout<<v.top()<<endl;//栈输出栈顶为top
						v.pop();//栈顶出栈
					}
				}
			}
		}
	}
	system("pasue");
	return 0;
}

AC代码如下: 

#include<cstdio>
#include<cstring>
#include<stack>
#include<queue>
using namespace std;
 
stack<int>a;
queue<int>b;
int main()
{
	char s[10100],s1[10];
	int t,c,n;
	scanf("%d",&t);	
	while(t--)
	{		
		scanf("%d %s",&n,s);
		if(strcmp(s,"FIFO")==0)
		{
			while(n--)
			{
				scanf("%s",s1);
				if(strcmp(s1,"IN")==0)
				{
					scanf("%d",&c);
					b.push(c);
				}
				else
				{
					if(b.empty()) printf("None\n");
					else 
					{
						printf("%d\n",b.front());
						b.pop();
					}
				}
			}		
		}
		else
		{
			while(n--)
			{
				scanf("%s",s1);
				if(strcmp(s1,"IN")==0)
				{
					scanf("%d",&c);
					a.push(c);
				}
				else
				{
					if(a.empty()) printf("None\n");
					else 
					{
						printf("%d\n",a.top());
						a.pop();
					}
				}								
			}
		}
		while(!a.empty()) a.pop();
		while(!b.empty()) b.pop();
	}
	return 0;
}