//降序
#include <bits/stdc++.h>
using namespace std;
int main(){
int a[]={30,50,60,10,20,40};
//默认升序
//sort(a,a+5);
//sort(a,a+5,less<int>())
sort(a,a+6,greater<int>());
for(int i=0;i<6;i++){
cout<<a[i]<<" ";
}
cout<<endl;
return 0;
}
//传统的降序
#include <bits/stdc++.h>
using namespace std;
bool cmp(int a, int b) {
if (a > b) {
return true;
} else {
return false;
}
}
int main() {
int a[] = {2, 5, 1, 3, 6, 1, 7, 9};
int n = sizeof(a) / sizeof(int);
sort(a, a + n, cmp);
for (int i = 0; i < n; i++) {
cout << a[i] << " ";
}
return 0;
}
11-24
258