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

24 votes195 views2 answers
C++ reverse part of vector
C++
0 vote151 views1 answer
"StepFileGen1." cpp.o failed jetson nano
C++
4 votes144 views6 answers
C++ length of char array
C++
36 votes146 views2 answers
Remove at index vector c++
C++
1 vote135 views1 answer
C++ vector structure
C++
16 votes148 views1 answer
If vector contains value c++
C++
0 vote143 views1 answer
Cpp console progressbar
C++
6 votes147 views1 answer
How to dynamically allocate an array c++
C++
0 vote141 views1 answer
Come concatenare stringhe in c++
C++
0 vote160 views1 answer
Can derived class access base class non-static members without object of the base class
C++