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 vote236 views1 answer
Write C++ program to sort an array in ascending order
C++
0 vote247 views1 answer
C++ convert integer to digits, as vector
C++
1 vote238 views1 answer
Cout console
C++
0 vote213 views1 answer
Define c++
C++
1 vote229 views1 answer
C++ multithreading
C++
3 votes225 views1 answer
Function in struct c++
C++
0 vote253 views2 answers
Ue4 c++ replicate actor variable
C++
0 vote232 views1 answer
C++ method name
C++
-1 vote243 views5 answers
Memset in c++
C++
0 vote231 views1 answer
For loop f#
C++