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 vote147 views3 answers
C++ variable type
C++
11 votes156 views1 answer
Inserting at start in vector c++
C++
0 vote187 views1 answer
Prime or not in cpp
C++
0 vote172 views1 answer
The statement vector vector int matrix(100 vector int (50 100) ) declares
C++
1 vote198 views1 answer
How to compare two char* in c++
C++
0 vote112 views1 answer
Replace a substring with another string in c++
C++
0 vote153 views1 answer
Traversing a map
C++
1 vote154 views1 answer
Operator overloading
C++
3 votes174 views5 answers
Combine two vectors c++
C++
11 votes169 views5 answers
How to sort array in c++
C++