Difference among these two expression

[ride-code]

priority_queue<pi, vector, greater > pq;
and
priority_queue<pair<int, int> > pq;

[aman212yadav (Aman Yadav)]

hello @ride-code

@ride-code

priority_queue<pair<int, int> > pq;

here we are declaring max heap

@ride-code

priority_queue<pi, vector, greater > pq;

here we are declaring min heap

[ride-code]

does this vector make any change?

[aman212yadav (Aman Yadav)]

…

@ride-code

does this vector make any change?

yeah its required. through that we are telling where the elements are stored.
its mandatory if we want to use min heap.

refer this for explanation of all three aruguments that we are passing in pq.

[ride-code]

meanwhile for using min heap we have to use priority_queue<pi, vector, greater > pq; expression

[aman212yadav (Aman Yadav)]

yeah , . . …

[aman212yadav (Aman Yadav)]

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.