题解 | 整数奇偶排序

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    vector<int> odd;
    vector<int> even;
    int a;
    while (cin >> a) {
        if(a%2==0)  even.push_back(a);
        else if(a%2==1) odd.push_back(a);
        // 既然读到了第 1 个，剩下的 9 个肯定也要读完
        for (int i = 1; i < 10; i++) {
            cin >> a;
            if(a%2==0)  even.push_back(a);
            else if(a%2==1) odd.push_back(a);
        }
        sort(odd.begin(),odd.end(),[](int&a,int&b){
            return a>b;
        });
        sort(even.begin(),even.end());
        for(int i:odd) cout<<i<<" ";
        for(int i:even) cout<<i<<" ";
        odd.clear();
        even.clear();
    }
    return 0;
}