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 vote131 views1 answer
What does catch(...) mean in c++
C++
3 votes118 views1 answer
C++ check if string contains uppercase
C++
0 vote128 views1 answer
C++ compile to exe
C++
0 vote127 views1 answer
#include<iostream> using namespace std; main() { char s[] = "Fine"; *s = 'N'; cout<<s<<endl; }
C++
5 votes83 views2 answers
Variables in c++
C++
1 vote122 views1 answer
Cpp code for euclids GCD
C++
0 vote121 views1 answer
Char at in c++
C++
0 vote131 views1 answer
Get elements of 2d array c++
C++
22 votes146 views6 answers
Sort array in descending order c++
C++
1 vote123 views1 answer
Get handle in C++
C++