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 vote160 views1 answer
To toggle (flip the status of) the k-th item of the set
C++
0 vote147 views1 answer
C++ do every 1 minutes
C++
2 votes148 views3 answers
How to find length of character array in c++
C++
0 vote149 views1 answer
C+ - Dormir en millisecondes
C++
-1 vote179 views1 answer
What does for do in c++
C++
-1 vote158 views1 answer
51 13 C:\Users\usuario\Documents\Destajo 1.cpp [Error] 'gotoxy' was not declared in this scope
C++
4 votes159 views3 answers
C plus
C++
4 votes178 views4 answers
Pointer
C++
0 vote178 views1 answer
Calculate if year is leap year
C++
1 vote147 views1 answer
How to easily trim a str in c++
C++