队列练习，个人理解

洛谷：B3616 【模板】队列

#include <iostream>
#include <vector>
#include <queue>
using namespace std; 
// vector<int> Queue(0); 
queue<int> mem; 
int main()
{
    int n; 
    cin >> n; 
    while(n--)
    {
        int m; // 表示操作1,2,3,4
        cin >> m; 
        if(m == 1) // 将元素m加入队列
        {
            int num; 
            cin >> num; 
            // Queue.push_back(num); 
            mem.push(num); 
        }
        if(m == 2) // 将队首元素弹出队列
        {
            // if(Queue.size() == 0) cout << "ERR_CANNOT_POP" << endl; 
            // else Queue.erase(Queue.begin()); 
            if(mem.size() == 0) cout << "ERR_CANNOT_POP" << endl; 
            else mem.pop(); 
        }
        if(m == 3) // 查询队首
        {
            // if(Queue.size() == 0) cout << "ERR_CANNOT_QUERY" <<endl; 
            // else cout << Queue[0] << endl;
            if(mem.size() == 0) cout << "ERR_CANNOT_QUERY" << endl; 
            else cout << mem.front() << endl; // 访问队首元素
        }
        if(m == 4) // 查询元素个数
        {
            // cout << Queue.size() << endl; 
            cout << mem.size() << endl; 
        }
    }
    system("pause"); 
    return 0;
}