#include<iostream>
#include<stack>
using namespace std;
int main() {
stack<int> s;
s.push(1);
s.push(2);
s.push(3);
s.push(4);
cout << "移除栈顶元素";
s.pop();
cout << endl;
cout << "栈顶元素:" << s.top() << endl;
cout << "栈中元素数目:" << s.size() << endl;
cout << "栈是否为空:" << s.empty() << endl;
return 0;
}
测试结果: