sort函数的排序:
#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <cmath>
#include <sstream>
#include <vector>
#include <queue>
using namespace std;
//自定义比较函数
bool cmp(const int& a,const int& b){//注意:本函数的参数的类型一定要与vector<elemType>中元素的类型一致
return a>b;
}
int main(){
int num[5]={1,12,5,66,43};
vector<int> a(num,num+5);
//默认排序从小到大
sort(a.begin(),a.end());
for(vector<int>::iterator it=a.begin();it!=a.end();++it)
cout<<*it<<" ";
cout<<endl;
//greater<int>() 从大到小
sort(a.begin(),a.end(),greater<int>());
for(vector<int>::iterator it=a.begin();it!=a.end();++it)
cout<<*it<<" ";
cout<<endl;
//自定义比较函数 从大到小
sort(a.begin(),a.end(),cmp);
for(vector<int>::iterator it=a.begin();it!=a.end()