队列的基本操作
queue<int>s;
队列是先入先出 FIRST IN FIRST OUT
s.push(yarudeyuansu)压入队列
s.size()目前队列元素的个数
s.front()目前队列的队首元素
s.back()目前队列的队尾元素
s.empty()判断队列是不是空，空的话返回true(1)不空的话返回false(或者0)
s.pop()去掉队中第一个的元素
#include<cstdio>
#include<queue>
using namespace std;
int main()
{
queue<int>s;
s.push(1);
printf("duilieshibushikongne %d\n",s.empty());
printf("duiliezhongdiyigeyuansushishenmene %d\n",s.front());
printf("duiliezuihouyigeyuansushishenmene %d\n",s.back());
printf("duiliededaxiaoshiduoshaone %d\n",s.size());
s.push(15);
printf("duilieshibushikongne %d\n",s.empty());
printf("duiliezhongdiyigeyuansushishenmene %d\n",s.front());
printf("duiliezuihouyigeyuansushishenmene %d\n",s.back());
printf("duiliededaxiaoshiduoshaone %d\n",s.size());
s.push(48);
printf("duilieshibushikongne %d\n",s.empty());
printf("duiliezhongdiyigeyuansushishenmene %d\n",s.front());
printf("duiliezuihouyigeyuansushishenmene %d\n",s.back());
printf("duiliededaxiaoshiduoshaone %d\n",s.size());
s.pop();
printf("duilieshibushikongne %d\n",s.empty());
printf("duiliezhongdiyigeyuansushishenmene %d\n",s.front());
printf("duiliezuihouyigeyuansushishenmene %d\n",s.back());
printf("duiliededaxiaoshiduoshaone %d\n",s.size());
s.pop();
printf("duilieshibushikongne %d\n",s.empty());
printf("duiliezhongdiyigeyuansushishenmene %d\n",s.front());
printf("duiliezuihouyigeyuansushishenmene %d\n",s.back());
printf("duiliededaxiaoshiduoshaone %d\n",s.size());
s.pop();
printf("duilieshibushikongne %d\n",s.empty());
return 0;
}