#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstdio>
#include <cctype>
#include <unordered_map>
#include <map>
using namespace std;
const int N = 105;
typedef pair<int, string> PII;
int main(){
int arr[11];
while(cin>>arr[0]>>arr[1]>>arr[2]>>arr[3]>>arr[4]>>arr[5]>>arr[6]>>arr[7]>>arr[8]>>arr[9]){
vector<int> odd, even;
for(int i = 0; i < 10; i++){
if(arr[i]&1) odd.push_back(arr[i]);
else even.push_back(arr[i]);
}
sort(odd.rbegin(), odd.rend());
sort(even.begin(), even.end());
for(int i = 0; i < odd.size(); i++){
if(i) cout<<" ";
cout<<odd[i];
}
for(auto x: even){
cout<<" "<<x;
}
cout<<endl;
}
return 0;
}
整数奇偶排序【北京大学】
最新推荐文章于 2024-01-25 19:39:20 发布