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 vote171 views1 answer
C++ typedef template class
C++
1 vote152 views6 answers
Insertion sort
C++
0 vote155 views1 answer
C++ declare binary number
C++
14 votes171 views2 answers
How to sort in descending order in c++
C++
25 votes178 views6 answers
String to int c++
C++
1 vote337 views1 answer
How to iterater map of sets in c++
C++
4 votes152 views1 answer
Shuffle vector c++
C++
0 vote177 views1 answer
C++ dll exports
C++
0 vote154 views1 answer
C ++ split_string
C++
0 vote164 views3 answers
Script hack blox fruti
C++