//C++std容器实现queue队列
#include <iostream>
#include <queue>
using namespace std;
 
int main(){
	queue<int> q;//创建一个队列，存储int类型元素
	//入队操作
	q.push(10);
	cout<<"入队：10"<<endl;
	q.push(20);
	cout<<"入队"<<endl;
	q.push(30);
	cout<<"30"<<endl;
	cout<<"访问队列的第一个元素"<<q.front()<<endl;
	cout<<"队列最后一个元素"<<q.back()<<endl;
 
	//清空队列
	while(!q.empty()){
		cout<<"移除"<<q.front()<<endl;
		q.pop();
	}
	cout<<"队列已经清空"<<endl;
	return 0;
 
}

Ly9DKytzdGTlrrnlmajlrp7njrBxdWV1ZemYn+WIlwojaW5jbHVkZSA8aW9zdHJlYW0+CiNpbmNsdWRlIDxxdWV1ZT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCl7CglxdWV1ZTxpbnQ+IHE7Ly/liJvlu7rkuIDkuKrpmJ/liJfvvIzlrZjlgqhpbnTnsbvlnovlhYPntKAKCS8v5YWl6Zif5pON5L2cCglxLnB1c2goMTApOwoJY291dDw8IuWFpemYn++8mjEwIjw8ZW5kbDsKCXEucHVzaCgyMCk7Cgljb3V0PDwi5YWl6ZifIjw8ZW5kbDsKCXEucHVzaCgzMCk7Cgljb3V0PDwiMzAiPDxlbmRsOwoJY291dDw8Iuiuv+mXrumYn+WIl+eahOesrOS4gOS4quWFg+e0oCI8PHEuZnJvbnQoKTw8ZW5kbDsKCWNvdXQ8PCLpmJ/liJfmnIDlkI7kuIDkuKrlhYPntKAiPDxxLmJhY2soKTw8ZW5kbDsKCQoJLy/muIXnqbrpmJ/liJcKCXdoaWxlKCFxLmVtcHR5KCkpewoJCWNvdXQ8PCLnp7vpmaQiPDxxLmZyb250KCk8PGVuZGw7CgkJcS5wb3AoKTsKCX0KCWNvdXQ8PCLpmJ/liJflt7Lnu4/muIXnqboiPDxlbmRsOwoJcmV0dXJuIDA7CgkKfQ==