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 vote187 views1 answer
Srand() c++
C++
0 vote201 views1 answer
Backward chaining python
C++
0 vote191 views1 answer
Cplusplus
C++
0 vote146 views1 answer
Sleep not declared in this scope c++
C++
1 vote170 views1 answer
C++ random number 0 to 1
C++
2 votes198 views1 answer
Unity failed to load window layout
C++
1 vote183 views1 answer
Start with pure c++ and opengl gamedev
C++
1 vote185 views1 answer
Ue4 spawn actor c++
C++
1 vote178 views2 answers
Sort c++
C++
1 vote198 views1 answer
Get current date in c++
C++