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

7 votes308 views2 answers
Min heap stl
C++
0 vote407 views3 answers
Simplest code for stack implementation in c++
C++
-1 vote336 views2 answers
C++ split string by sstream
C++
0 vote340 views1 answer
How to allocate memory for vector c++
C++
6 votes320 views6 answers
Naruto
C++
0 vote326 views2 answers
Create a file
C++
-1 vote349 views1 answer
C++ pwstr to char*
C++
1 vote343 views1 answer
Check if intent has extras
C++
0 vote336 views1 answer
Convert vector into array c++
C++
0 vote325 views1 answer
The program must enter a natural number n from the console and find the number previous to n that is not divisible by 2 , 3 and 5 .
C++