入栈与出栈

#include<iostream>

#include<stack>

#include<cstring>

using namespace std;

int main()

{

     stack < int > b;

     int a[50],m,l,k;

     char s[5000][6];

     int i,n,j;

     while (cin>>n)

     {

     

         l=0;

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

         cin>>a[i];

     j=-1;

     m=-1;

     k=0;

     while (k<n)

     {

         cin>>s[++j];

         if ( strcmp (s[j], "push" )==0)

         {

             b.push(a[++m]);

         }

         else

         {

             if (l==0)

             {

             cout<<b.top();

             b.pop();

             l=1;

             ++k;

             }

             else

             {

             cout<< " " <<b.top();

             b.pop();

             ++k;

             }

         }

     if (k==n)

     {

         cout<<endl;

         break ;

     }

     }

     }

     return 0;

}