python/TangDou/XiTi/1121.cpp

#include <bits/stdc++.h>

using namespace std;

int main() {
    //奇数数组
    vector<int> jishu;
    //偶数数组
    vector<int> oushu;

    for (int i = 0; i < 10; ++i) {
        int c;
        cin >> c;
        if (c % 2 == 0) oushu.push_back(c);
        else jishu.push_back(c);
    }
    //奇数按从大到小排序
    sort(jishu.begin(), jishu.end(), greater<int>());

    //偶数按从小到大排序
    sort(oushu.begin(), oushu.end(),less<int>());

    //输出
    for (int i = 0; i < jishu.size(); ++i) {
        cout << jishu[i] << " ";
    }
    for (int i = 0; i < oushu.size(); ++i) {
        cout << oushu[i] << " ";
    }

    return 0;
}