STL中less和greater的用法

优先队列和sort函数中都有less和greater，但less和greater在优先队列和sort中的用法有些不同（这里以int为例）

一、优先队列中的less和greater

以int为例先声明一下

priority_queue<int> q;//默认从大到小出队
priority_queue<int, vector<int>, less<int> > q1;//从大到小出队
priority_queue<int, vector<int>, greater<int> > q2;//从小到大出队

示例代码

#include <bits/stdc++.h>
using namespace std;
priority_queue<int> q;
priority_queue<int, vector<int>, less<int> > q1;
priority_queue<int, vector<int>, greater<int> > q2;
int num[5] = {1, 2, 5, 4, 3};
int main(){
    for(int i = 0; i < 5; i++)
        q.push(num[i]), q1.push(num[i]), q2.push(num[i]);
    printf("nomal:");
    while(!q.empty())
        printf(" %d", q.top()), q.pop();//输出为5 4 3 2 1
    printf("\n");

    printf("less:");
    while(!q1.empty())
        printf(" %d", q1.top()), q1.pop();//输出为5 4 3 2 1
    printf("\n");

    printf("greater:");
    while(!q2.empty())
        printf(" %d", q2.top()), q2.pop();//输出为1 2 3 4 5
    printf("\n");
    return 0;
}

二、sort中的less和greater

以int为例先声明一下

sort(num, num + n);//默认从小到大排序
sort(num, num + n, less<int>());//从小到大排序
sort(num, num + n, greater<int>());//从大到小排序

示例代码

#include<bits/stdc++.h>
using namespace std;
int num[5] = {1, 2, 5, 4, 3};
int main(){
    printf("nomal:");
    sort(num, num + 5);
    for(int i = 0; i < 5; i++)
        printf(" %d", num[i]);//输出为1 2 3 4 5
    printf("\n");

    printf("less:");
    sort(num, num + 5, less<int>());
    for(int i = 0; i < 5; i++)
        printf(" %d", num[i]);//输出为1 2 3 4 5
    printf("\n");

    printf("greater:");
    sort(num, num + 5, greater<int>());
    for(int i = 0; i < 5; i++)
        printf(" %d", num[i]);//输出为5 4 3 2 1
    printf("\n");
    return 0;
}