题解 | #整数奇偶排序#

#include <bits/stdc++.h>
using namespace std;
int a[11];
int b[11];
int c[11];
bool cmp(int a, int b) {
    return a > b;
}
int main() {
    while (cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4] >> a[5] >> a[6] >> a[7] >>
            a[8] >> a[9]) {
        int j = 0;
        int k = 0;
        for (int i = 0; i < 10; i++) {
            if (a[i]%2 == 0) {
                b[j++] = a[i];   //偶数
            } else {
                c[k++] = a[i];
            }
        }
        sort(b, b + j);
        sort(c, c + k, cmp);
      for(int i=0;i<k;i++)
           { cout<<c[i]<<" ";}
        for(int i=0;i<j;i++)
           { cout<<b[i]<<" ";}
        cout<<endl;
    }

}
// 64 位输出请用 printf("%lld")