sort() 方法很实用,特别是在数据量较小的排序时;如果是数组排序,按如下排序即可;
若是vector<>容器下的则直接用sort(vec.begin() , vec.end(),greater<int>()) ;
#include <iostream>
#include <algorithm>
using namespace std ;
bool cmp (int a , int b) {
if (a > b) {
return true ;
}
return false ;
}
int main() {
int a[100] ;
int num ;
cin >> num ;
int i = 0 ;
int temp = num ;
while (temp --) {
cin >> a[i++] ;
}
sort(a,a+num,cmp) ;
for (int i = 0 ; i < num ; ++ i) {
cout << a[i] << " " ;
}
cout << endl ;
return 0 ;
}
用vector :
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std ;
int main() {
vector<int> vec ;
int n ;
cin >> n ;
int num = n ;
while (num--) {
int temp ;
cin >> temp ;
vec.push_back(temp) ;
}
sort(vec.begin() , vec.end() , less<int>()) ;
for (vector<int>::iterator iter = vec.begin() ; iter != vec.end() ; ++ iter) {
cout << * iter << " " ;
}
cout << endl ;
return 0 ;
}