题解

宣纸

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>> n;
    stack <int> a;
    for(int i=1;i<=n;i++){
        int x;
        cin>>x;
        a.push(x);
    }
    while(!a.empty()){
        cout<<"=====stk.size["<<a.size()<<"]======"<<endl;
        cout<<"     stk.pop["<< a.top()<<"]"<<endl;
        a.pop();
    }
    return 0;
}