题解 | 整数奇偶排序

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

bool sequence(int a, int b) {
    if (a % 2 != b % 2) return a % 2 > b % 2;
    else if (a % 2 == 1) return a > b;
    else    return a < b;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    vector<int> vec(10);
    while (cin >> vec[0] >> vec[1] >> vec[2] >> vec[3] >> vec[4] >> vec[5] >> vec[6]
            >> vec[7] >> vec[8] >> vec[9]) {
        sort(vec.begin(), vec.end(), sequence);
        for (int x : vec) cout << x << " ";
    }
    return 0;
}