Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <stack>
- using namespace std;
- int main(){
- int n;
- cin>>n;
- vector< vector<int> > sid(n, vector<int>(2, 0));
- for(int i=0;i<n;i++){
- cin>>sid[i][0];
- sid[i][1]=i+1;
- }
- for(int i=0;i<n;i++){
- for(int j=i+1;j<n;j++){
- if(sid[i][0]>sid[j][0]){
- swap(sid[i][0], sid[j][0]);
- swap(sid[i][1], sid[j][1]);
- }
- }
- }
- stack< vector<int> > q;
- int ped=0;
- char a;
- for(int i=0;i<2*n;i++){
- cin>>a;
- if(a=='0'){
- q.push(sid[ped]);
- cout<<q.top()[1]<<' ';
- ped++;
- }
- else{
- cout<<q.top()[1]<<' ';
- q.pop();
- }
- }
- }
Add Comment
Please, Sign In to add comment