priority_ Understanding of queue

priority_queue The higher the default value, the higher the priority , By default, sort by less than , But you become bigger than , That is to change the less than sort to greater than sort , The lower the value, the higher the priority .

#include <iostream>
#include <stdio.h>
#include <queue>
#include <string>
using namespace std;
//struct fruit
//{
//    string name;
//    int price;
//    friend bool operator < (fruit f1,fruit f2) // Nonmember functions need to be defined as friend functions 
//    {
//        return f1.price>f2.price;
//    }
//}f1,f2,f3;

/**
     Below operator< Is a member function of a class , His parameter is one less than the actual operand ,
     Because there is a this The pointer , He points to the left operand , You can use this this The pointer 
     To call this operand 
*/
struct fruit
{
    string name;
    int price;
    operator < (fruit f1) const
    {
        return price>f1.price;
    }
}f1,f2,f3;

/**
     You can define the structure ( class ） The operator is overloaded when , Of course, when the overloaded operator is a member function , Member functions 
     Of （ Show ） The number of parameters is one less than the number of operands ,this Bind to left operand ;
     When it is not a member function , To define as a friend function , That is, add the keyword before the function  friend , At this point, the parameters of the friend function 
     And the number of general functions is the same 
*/
int main()
{
    priority_queue<fruit> q;
    f1.name="taozi";
    f1.price=3;
    f2.name="lizi";
    f2.price=4;
    f3.name="pingguo";
    f3.price=1;
    q.push(f1);
    q.push(f2);
    q.push(f3);
    cout << q.top().name <<' ' <<  q.top().price  << endl;
    printf("Hello world!\n");
    return 0;
}