队列的应用

#include<iostream>

#include<cstring>

using namespace std;

int main()

{

    int n;

    cin>>n;

    string s;

    int q[100000];

    int j=-1,k=-1;

    int x;

    for(int i=0;i<n;i++)

    {

        cin>>s;

        if(s=="push")

        {

            cin>>x;

            q[++k]=x;

        }

        if(s=="pop")

        {

            if(j>=k)

            {

                cout<<"error"<<endl;

            }

            else

            {

                cout<<q[++j]<<endl;         //++j的意思是输出队首并且让它删除（j==k）

            }

        }

        if(s=="front")

        {

            if(j>=k)

            {

                cout<<"error"<<endl;

            }

            else

            {

                cout<<q[j+1]<<endl;       //j+1是让数组元素下移一位，而j的值不变，即是让队首不删除

            }                              

        }

    }

    return 0;

}