OJ刷题记录：银行业务队列简单模拟 题目编号:1023

#include <iostream>

using namespace std;

int main() {
	int n;

	cin >> n;

	const int LEN = n;
	int arr[LEN];
	int odd[LEN];
	int even[LEN];

	for (int i = 0; i < LEN; i++) {
		cin >> arr[i];
	}

	int count1 = 0, count2 = 0;

	for (int i = 0; i < LEN; i++) {
		if (arr[i] % 2 != 0) {
			odd[count1] = arr[i];
			count1++;
		} else {
			even[count2] = arr[i];
			count2++;
		}
	}
	
	int i = 0, j = 0; 
	
	while (count1 != 0 || count2 != 0) {
		if (count1 > 0) {
			cout << odd[i] << ' ';
			i++;
			count1--;
		}
		if (count1 > 0) {
			cout << odd[i] << ' ';
			i++;
			count1--;
		}
		if (count2 > 0) {
			cout << even[j] << ' ';
			j++;
			count2--;
		}
	}

	return 0;
}
}