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 vote169 views1 answer
C++ const shared_ptr
C++
1 vote158 views1 answer
Vector2 c++
C++
0 vote194 views1 answer
How can I convert each and every element of string push into set in c++?
C++
0 vote179 views1 answer
How to print items in c++
C++
1 vote176 views6 answers
Insertion sort
C++
0 vote184 views1 answer
Template member functions in cpp files
C++
3 votes162 views3 answers
C vs c++ vs c#
C++
326 votes470 views3 answers
How to remove to an Array
C++
0 vote174 views1 answer
Vermífugo significado
C++
0 vote129 views1 answer
Libraries required for gaming in c++
C++