7-18 银行业务队列简单模拟 (25 分)

简单模拟

#include <iostream>
#include <queue>
using namespace std;
int main(){
	int n, x;
	queue<int> A, B;
	cin>>n;
	for(int i = 0; i < n; i++){
		cin>>x;
		if(x&1) A.push(x);
		else B.push(x);
	}
	int tag = 0;
	while(A.size() || B.size()){
		if(A.size()) {
			if(!tag) {
				cout<<A.front();
				tag = 1;
			}
			else cout<<" "<<A.front();
			A.pop();
		}
		if(A.size()){
			cout<<" "<<A.front();
			A.pop();
		}
		if(B.size()){
			if(!tag) {
				cout<<B.front();
				tag = 1;
			}
			else cout<<" "<<B.front();
			B.pop();
		}
	}
	return 0;
}