南邮-2023-会漏的栈

#include<iostream>
#include<string>
using namespace std; 
int main()
{
    int n,m;
    cin>>n>>m;
    int *a=new int[n];
    int size=0;
    while(m--)
    {
        string ch;
        int x,i;
        cin>>ch;
        if(ch=="push")
        {
            cin>>x;
            for(i=0;i<n-1;i++)
            {
                a[i]=a[i+1];
            }            
            a[n-1]=x;
            if(size<n) size++;
        }
        if(ch=="pop")
        {
            if(size==0) cout<<"Empty!"<<endl;
            else
            {
                cout<<a[n-1]<<endl;
                for(i=n-1;i>=0;i--)
                {
                    a[i]=a[i-1];
                }
                size--;
            }
        }
    }
    delete []a;
    return 0;
}