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

2 votes346 views1 answer
C++ get file content
C++
0 vote352 views1 answer
Remove a element from an array c++
C++
0 vote369 views1 answer
Exit: redefinition; '__declspec(noreturn)' or '[[noreturn]]'
C++
0 vote379 views1 answer
Std distance
C++
0 vote347 views1 answer
Tabeau dynamique c++
C++
0 vote337 views1 answer
Udo apt install dotnet-sdk-5 permission denied
C++
0 vote320 views1 answer
Display dot product of two Arrays.
C++
22 votes404 views4 answers
Cpp get last element of vector
C++
0 vote354 views1 answer
Bnchch
C++
29 votes325 views10 answers
Hello world c++
C++