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

1 vote179 views1 answer
Rotate in c++
C++
0 vote167 views1 answer
Ordine crescente "senza" vettori in c++
C++
0 vote169 views2 answers
Lcm in c++
C++
1 vote196 views2 answers
How to print numbers with only 2 digits after decimal point in c++
C++
0 vote168 views1 answer
C++ Attribute Parser
C++
1 vote171 views10 answers
Js
C++
0 vote182 views1 answer
Find the biggest element in the array
C++
1 vote181 views1 answer
C++ in linux
C++
1 vote175 views1 answer
Modulo Exponentiaon,Iteratve Modulo Exponentiation
C++
0 vote159 views1 answer
C++ code 2d block
C++