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 vote171 views2 answers
Round all columns in R dataframe to 3 digits
C++
1 vote180 views1 answer
How to loop a 2 dimensional vector in c++ starting from second element
C++
2 votes234 views2 answers
Include cpp
C++
1 vote215 views2 answers
Read file into vector
C++
1 vote170 views1 answer
Check if point is left or right of vector
C++
1 vote173 views1 answer
Dev c++ tahe last word error
C++
2 votes167 views1 answer
Find character in string c++
C++
0 vote155 views1 answer
C++ shift array to the right
C++
1 vote171 views1 answer
Meter espacios en cadena c
C++
1 vote192 views1 answer
How to delete an element in vector pair in cpp
C++