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

-1 vote139 views1 answer
A[12] = h + A[8]
C++
0 vote138 views1 answer
How to traverse string like array in cpp
C++
0 vote129 views1 answer
Use of undeclared identifier '_O_U16TEXT'
C++
9 votes144 views4 answers
Print vector of vector c++
C++
7 votes183 views5 answers
Set precision in c++
C++
0 vote158 views1 answer
Remove element from c++
C++
-1 vote166 views2 answers
How to delete a file in cpp
C++
4 votes157 views5 answers
C++ int max value
C++
18 votes155 views5 answers
How to clear console c++
C++
0 vote141 views1 answer
Unknown number of threads cpp
C++