2020.8 复习 7-4 队列操作//PTA

对不起，偷个懒直接用queue了😆

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, op;
    cin >> n;
    queue<long long int> q;
    long long int input;
    while (n--)
    {
        cin >> op;
        switch (op)
        {
        case 1:
            cin >> input;
            q.push(input);
            break;
        case 2:
            if (q.empty())
                cout << "Invalid" << endl;
            else
            {
                cout << q.front() << endl;
                q.pop();
            }
            break;
        case 3:
            cout << q.size() << endl;
            break;
        default:
            break;
        }
    }
    return 0;
}