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

17 votes117 views4 answers
Max element in vector c++
C++
0 vote106 views1 answer
C++ text between substrings
C++
0 vote94 views1 answer
Cpp get keystroke in console only
C++
0 vote92 views1 answer
C++ print unsigned long
C++
1 vote100 views1 answer
Cout char32_t c++
C++
7 votes56 views1 answer
Remove from the front of a vector
C++
0 vote107 views1 answer
Partition in STL using vector
C++
6 votes102 views4 answers
Map c++
C++
0 vote105 views1 answer
Shell-Sort C++
C++
2 votes111 views1 answer
Built in function in c++ for binary to decimal
C++