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 vote282 views1 answer
Gettimeofday header file
C++
31 votes226 views1 answer
When to use struct vs class c++
C++
0 vote278 views1 answer
Vector of strings initialization c++
C++
2 votes247 views1 answer
How to hide ui elements unity
C++
0 vote271 views1 answer
Strong number in c++
C++
19 votes262 views6 answers
Initialize 2D vector
C++
1 vote209 views1 answer
Qt can't use ^ operator on qchar
C++
0 vote246 views1 answer
Flowchart to display factors of a number
C++
54 votes330 views2 answers
C# toint
C++
5 votes242 views3 answers
Pneumonia
C++