【题解】T1181 整数奇偶排序

#include <bits/stdc++.h>
using namespace std;
bool cmpUp(int a, int b)//升序 
{
    return a < b;
}
bool cmpDown(int a, int b)//降序 
{
    return a > b;
}
int main()
{
    int a, odd[15], even[15], oi = 0, ei = 0;//oi：odd中元素个数 ei：even中元素个数 
	for(int i = 1; i <= 10; ++i)
	{
	    cin >> a;
	    if(a%2 == 0)
	       even[++ei] = a;//填充数组 
	    else
	       odd[++oi] = a;
    }
    sort(odd+1, odd+1+oi, cmpDown);//奇数降序排序 
    sort(even+1, even+1+ei, cmpUp);//偶数升序排序
    for(int i = 1; i <= oi; ++i)
        cout << odd[i] << ' ';
    for(int i = 1; i <= ei; ++i)
        cout << even[i] << ' '; 
	return 0;
}