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 vote331 views1 answer
C++ iterate over vector of pointers
C++
0 vote306 views1 answer
Google pdf iframe viwer
C++
0 vote330 views1 answer
Raspberry pi mount external hard drive
C++
12 votes349 views3 answers
C++ max of array
C++
0 vote318 views1 answer
Set iterator
C++
1 vote320 views2 answers
Lambda capture as const cpp
C++
1 vote310 views1 answer
Visual studio cpp compiler
C++
1 vote348 views1 answer
C++ in linux
C++
-1 vote314 views2 answers
Convert c++ to mips
C++
2 votes327 views3 answers
C++ string find last number
C++