银行业务队列简单模拟

Posted 2022-09-09 zzjam--1

#include <iostream>
#include<cstdlib>
#include<stack>
#include <queue>
#include <deque>
#include<iostream>
#include<vector>
#include<algorithm>
#include<list>
#include<string>
using namespace std;
int main()

    
queue<int> q1, q2;
       int a,n,i,c,f = 0;
    cin>>n;
    for(i=0;i<n;i++)
   
       cin>>a;
       if(a % 2) q1.push(a);
        else q2.push(a);
   
    while(!q1.empty() && !q2.empty())
     
        if(!q1.empty()) 
         if(f!=0)
         cout<<" ";
          if(f==0) 
          f=1; 
          cout << q1.front(); 
          q1.pop(); 
          
        if(!q1.empty()) 
         
        if(f!=0)
        cout<<" ";
          if(f==0) 
          f=1;
          cout << q1.front();
           q1.pop(); 
           
        if(!q2.empty()) 
         
        if(f!=0) 
        cout<<" ";
         if(f==0) 
         f=1;
         cout << q2.front();
         q2.pop(); 
         
    
    while(!q1.empty())
      
     if(f!=0)
     cout<<" ";
       if(f==0) 
       f=1;
       cout << q1.front();
        q1.pop(); 
        
    while(!q2.empty())
     
     if(f!=0) 
    cout<<" "; 
    if(f==0) 
    f=1;
    cout << q2.front();
     q2.pop(); 
     

    return 0;