c++ sort（）函数应用举例

ps：letcode 1333. 餐厅过滤器
static bool cmp(const vector<int> &a,const vector<int> &b)  
//很多时候都要添加static  否则不能通过的
 {
     return (a[1]>b[1])||(a[1] == b[1]&&a[0]>b[0]);
 }
sort(res.begin(),res.end(), cmp);

等同于：
sort(res.begin(),res.end(),[](const auto& a,const auto& b){
    return (a[1]>b[1])||(a[1]==b[1]&&a[0]>b[0]);
});

letcode 973. 最接近原点的 K 个点

static bool cmp(const vector<int> a,vector<int> b){
    return ((a[0]*a[0]+a[1]*a[1])<(b[0]*b[0]+b[1]*b[1]));
}

static bool judge(const pair<int,float> &a,const pair<int,float> &b){
   return a.first<b.first;
}
vector<pair<int,float>> car;
sort(car.begin(),car.end(),judge);

改变第三个参数

#include<iostream>
#include<algorithm>
using namespace std;
bool cmp(int a, int b){
	return a > b;
}
int main()
{
	//sort函数第三个参数采用默认从小到大
	int a[] = { 45, 12, 34, 77, 90, 11, 2, 4, 5, 55 };
	sort(a, a + 10, cmp);
	for (int i = 0; i<10; i++)
		cout << a[i] << " ";
	cout << endl;
	system("pause");
	return 0;
}

对于结构体或者类的排序需要对第三参数进行重定义

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
struct Student
{
	char name;
	int age;
	int score;
};
bool comp(Student a, Student b);
int main()
{

	Student a[3] = { { 'a',20, 80 }, { 'a',18, 90 }, { 'c',19, 85 } };

	sort(a, a + 3,comp);
	for (int i = 0; i<3; i++)
		cout <<a[i].name<<" "<<a[i].age<<" "<<a[i].score << " ";
	cout << endl;
	system("pause");
	return 0;
}
bool comp(Student a, Student b)
{
	if (a.name<b.name)
		return a.name > b.name; //名字从大到小排列
	else if (a.name == b.name)  //如果名字相同，年龄从小到大排列
		return a.age<b.age;
}

sort对于pair排序

参考：https://www.cnblogs.com/bigyang/p/8590552.html

https://blog.csdn.net/qian2213762498/article/details/81773289