#include<iostream.h>
struct listnode
{
	int data;
	listnode *next;
};
class stack
{
private:
	listnode *top;
public:
	stack()
	{
		top=NULL;
	}
	void push(int item)
	{
		listnode *p;
		p=new listnode;
		p->data=item;
		p->next=top;
		top=p;
	}
    int pop()
	{
		int result=top->data;
		listnode *q;
		q=top;
		top=top->next;
		delete q;
		return result;
	}
	 void disp()
	 {
		 listnode *r;
		 r=top;
		 while(r!=NULL)
		 {
			 cout<<r->data<<" ";
			 r=r->next;
		 }		
	 }
};
	 void main()
	 {
		 int n,x,m;
		 stack l1;
		 cout<<"輸入元素個數(shù)：";
		 cin>>n;
		 for(int i=1;i<=n;i++)
		 {
			 cout<<"輸入第"<<i<<"個元素："<<endl;
			 cin>>x;
			 l1.push(x);
		 }
		 cout<<"開始棧為："<<endl;
		 l1.disp();
		 cout<<endl;
		 cout<<"輸入要出棧元素個數(shù)：";
		 cin>>m;
		 for(i=1;i<=m;i++)
		 {
			 l1.pop();
		 }
		 cout<<"出棧之后棧為："<<endl;
		 l1.disp();
	 }