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

10 votes332 views2 answers
Double to string c++
C++
4 votes346 views1 answer
Shuffle vector c++
C++
0 vote314 views1 answer
Servicenow cart api
C++
2 votes322 views2 answers
How to get cursor position c++
C++
0 vote330 views1 answer
Cout.flush() in c++
C++
0 vote326 views1 answer
Namespace c++
C++
1 vote299 views1 answer
Print linkedstack cpp
C++
0 vote325 views1 answer
Making content editable
C++
0 vote341 views1 answer
Error: Microsoft Visual C++ 14.0 or greater is required. Get it with "Microsoft C++ Build Tools":
C++
8 votes329 views3 answers
Stack implementation using class in c++
C++