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 vote123 views1 answer
Implementing split function in c++
C++
0 vote137 views1 answer
Libc++abi.dylib: terminating with uncaught exception of type std::invalid_argument: stoi: no conversion
C++
-1 vote133 views4 answers
Convert c++ to c online
C++
1 vote82 views1 answer
Qt can't use ^ operator on qchar
C++
1 vote131 views1 answer
String c++ if letter or number
C++
0 vote129 views1 answer
One dimensiol array to two dimen c++
C++
0 vote123 views1 answer
QT form doesn't take changes
C++
6 votes115 views3 answers
How to kill
C++
0 vote135 views1 answer
Iteraate through a vector
C++
0 vote125 views1 answer
Can you use rand to read in from an external file inc++
C++