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 vote216 views1 answer
C++ looping through a vector
C++
0 vote231 views2 answers
Comment savoir si un nombre est premier c++
C++
0 vote347 views1 answer
Why constructor can't be static in c++
C++
0 vote207 views1 answer
C++ include <> vs ""
C++
0 vote214 views1 answer
How to bath without water
C++
0 vote210 views1 answer
Compare values within within a vector c++
C++
0 vote234 views1 answer
Backward chaining python
C++
93 votes306 views4 answers
C++ get time
C++
1 vote222 views1 answer
C++ milliseconds
C++
0 vote237 views1 answer
Pallindrome string
C++