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

1 vote271 views1 answer
Print hello world on c++
C++
0 vote275 views1 answer
Split 2d array into chunks in c++
C++
12 votes249 views6 answers
Loop through map c++
C++
0 vote274 views1 answer
How to change the icon of an exe in c++
C++
0 vote264 views1 answer
Cudamemcpy
C++
-1 vote287 views1 answer
How to write hello world c++
C++
6 votes280 views3 answers
Convert set to vector c++
C++
0 vote279 views1 answer
How to create a c++ templeate
C++
9 votes254 views1 answer
C++ code to print hello world
C++
3 votes248 views3 answers
Error handling in C++
C++