stack

#include<bits/stdc++.h>
using namespace std;
int main()
{
	stack<int> s;
	stack<int> s1;
	for(int i=1;i<=15;i++){
		s.push(i);
	}
	cout<<"栈中元素个数："<<s.size()<<endl;
	cout<<"栈顶元素是："<<s.top()<<endl;
	s.pop();             //删除栈顶元素
	
	s1=s;
	while(!s1.empty()){
		cout<<s1.top()<<" ";
		s1.pop();
	}
	cout<<endl;
	
	cout<<"栈中元素个数："<<s.size()<<endl;
	cout<<"栈中元素个数："<<s1.size()<<endl;	
	return 0;
}