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 vote283 views1 answer
C++ require keyword
C++
0 vote302 views6 answers
Template c++
C++
0 vote289 views1 answer
Get elements of 2d array c++
C++
0 vote300 views1 answer
Take pieces of a string in c++
C++
1 vote285 views1 answer
Prime numbers less than a given number c++
C++
1 vote282 views1 answer
C++ base constructor
C++
1 vote304 views1 answer
Can you chnage the address of a pointer
C++
1 vote319 views1 answer
Array sum in c++ stl
C++
0 vote282 views1 answer
How the theam are store in database
C++
0 vote284 views1 answer
Print value of data in c++
C++