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 vote285 views1 answer
C language all keywords in string
C++
-1 vote262 views1 answer
How to initialize static member variable of a class in c++
C++
1 vote271 views1 answer
Function overloading in c++
C++
1 vote313 views1 answer
Right side pattern triangle c++
C++
3 votes304 views2 answers
C++ check if string contains substring
C++
0 vote273 views3 answers
An array that take different data type c++
C++
0 vote268 views1 answer
Vector stop at newline
C++
0 vote275 views1 answer
Random key generator c++ all unique characters
C++
0 vote281 views1 answer
Static_cast c++
C++
2 votes270 views1 answer
C++ terminal color
C++