笔记
vector + sort 的用法
vector(a.begin(), a,end());
代码
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int N = 20;
bool cmp(int a, int b) {
return a > b;
}
vector<int> a, b;
int main() {
int temp;
for(int i = 0; i < 10; i++) {
cin>>temp;
if(temp % 2 == 0) a.push_back(temp);
else b.push_back(temp);
}
sort(a.begin(), a.end());
sort(b.begin(), b.end(), cmp);
for(int i = 0; i < b.size(); i++) cout<<b[i]<<" ";
for(int j = 0; j < a.size(); j++) cout<<a[j]<<" ";
return 0;
}