栈道
栈和排序
https://ac.nowcoder.com/acm/problem/14893
include<bits/stdc++.h>
using namespace std;
stack<int>q;
int n,t,m,i;
int main() {
cin >> n;
for (i = 0,m=n; i < n; i++) {
cin >> t;
if (t == m){
cout << t << " ";
m--;
}
else q.push(t);
}
for (int i =q.size(); i>1;i--) {
cout<< q.top()<<" ";
q.pop();
}
/for(int i=1;i<q.size();i++){
cout<< q.top()<<" ";
q.pop();
}///区别
cout << q.top()<< endl;
return 0;
}</int>