//#include <algorithm>
//#include <vector>
#include <iostream>
#include <stack>
using namespace std;
int main()
{
stack<int> jin1; //定义堆栈对象
for (int i = 0; i < 10; i++)
jin1.push(i); //将数据压入堆栈
while (!jin1.empty())
{
cout << jin1.top() << " "; //弹出堆栈第一个元素
jin1.pop(); //指向下一个
}
cout << endl;
return 0;
}