STL sort comp cmp 函数的写法

话不多说 上代码

结构体：

#include <bits/stdc++.h>
#define MAX_N 100005

using namespace std;

int n;
struct node {
    int num;
    char nam[21];
}a[MAX_N];

bool cmp (const node x,const node y){return x.num<y.num;}


int main (){
    cin >> n;
    for (int i=1;i<=n;++i)
        cin >> a[i].num >> a[i].nam ;
    sort (a+1,a+n+1,cmp);
    for (int i=1;i<=n;++i)
        cout << a[i].num << ' ' << a[i].nam << endl;
}


/*
int main (){
    cin >> n;
    for (int i(1);i<= n;++i)
        cin >> a[i];
    sort (a+1,a+n+1);
    for (int i(1);i<=n;++i)
        cout << a[i] << ' ';
    return 0;
}
*/

普通型：

#include <bits/stdc++.h>
#define MAX_N 100005

using namespace std;

int n,a[MAX_N];
bool cmp (int x,int y){
    return x>y;
}

int main (){
    cin >> n;
    for (int i=1;i<=n;++i)
        cin >> a[i];
    sort (a+1,a+n+1,cmp);
    for (int i=1;i<=n;++i)
        cout << a[i] << ' ';

    return 0;
}