Comparator priority queue c++

How to use comparator funtion in priority queue in c++

// suppose you want to apply comparator on pair <int, string>
// declaration of priority queue
priority_queue<pair<int, string>, vector<pair<int, string>>, myComp> pq;
// here myComp is comparator
struct myComp {
  bool operator()(
    pair<int, string>& a,
    pair<int, string>& b)
  {
    return a.first > b.first;
    // can write more code if required. depends upon requirement.
  }
};

Comparator priority queue c++

struct CompareHeight {
    bool operator()(Person const& p1, Person const& p2)
    {
        // return "true" if "p1" is ordered
        // before "p2", for example:
        return p1.height < p2.height;
    }
};

Source: geeksforgeeks.org

Similar codes

0 vote292 views1 answer
How to fill vector from inputs c++
C++
2 votes332 views1 answer
How to use python sleep function on c++
C++
7 votes317 views3 answers
Length of 2d array c++
C++
19 votes312 views1 answer
C++ writing to file
C++
4 votes296 views1 answer
Eosio multi index secondary index
C++
1 vote319 views1 answer
Default access specifier in c++
C++
2 votes323 views1 answer
Unity failed to load window layout
C++
0 vote312 views1 answer
Template member functions in cpp files
C++
0 vote311 views1 answer
C++ cout update percentage
C++
0 vote306 views1 answer
C++ fast
C++