/C++/How to use comparator funtion in priority queue in 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.
  }
};

Similar codes

7 votes617 views5 answers
Stoi cpp
C++
0 vote183 views1 answer
Empty 2d array as a member of a class class c++
C++
17 votes206 views6 answers
C vs c++
C++
0 vote183 views1 answer
Counting Sort C++
C++
0 vote224 views1 answer
Void linux java
C++
-1 vote167 views1 answer
How to array in c++
C++
1 vote194 views1 answer
Visual studio cpp compiler
C++
0 vote180 views1 answer
PUBG_APIKEY=<your-api-key> npm t
C++
0 vote225 views1 answer
Which version c++ single file in sublime is
C++
1 vote197 views1 answer
C++ return value of set insert
C++