7-2 银行业务队列简单模拟分数 25

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int N;
    cin >> N;
    queue<int>A;//A快
    queue<int>B;
    for (int i = 0; i < N; i++)
    {
        int num;
        cin >> num;
        if (num % 2 == 0)
            B.push(num);
        else
            A.push(num);
    }
    int num1 = 0, num2 = 0;
    while (!A.empty() || !B.empty())
    {
        if (!A.empty())
        {
            cout << A.front();
            A.pop();
             if(!A.empty() || !B.empty())cout<<" ";
            if (!A.empty())
            cout << A.front();
              A.pop();
             if(!A.empty() || !B.empty())cout<<" ";
        }
        if (!B.empty())
        {
            cout << B.front();
            B.pop();
            if(!A.empty() || !B.empty())cout<<" ";
        }
    }

    return 0;
}