题解 | #整数奇偶排序#

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

const int MAXN = 10;
int arr_ji[MAXN];
int arr_ou[MAXN];
bool compare_ji(int x, int y) {
    return x > y;
}
int main() {
    int j = 0, k = 0, tem = 0;
    for (int i = 0; i < 10; i++) {
        scanf("%d", &tem);
        if (tem % 2 == 0)arr_ou[j++] = tem;
        else arr_ji[k++] = tem;
    }
    sort(arr_ji, arr_ji + k, compare_ji);
    sort(arr_ou, arr_ou + j);
    for (int l = 0; l < k; l++)cout << arr_ji[l] << " ";
    for (int m = 0; m < j; m++)cout << arr_ou[m] << " ";
    return 0;
}