Priority Queue || User Defined Data-type || Min/Max Heap || C++ STL || Competitive Programming

00:00 - Intro 00:17 - Heap intro 03:40 - Min heap intro 04:40 - Max heap intro 06:05 - Code starts 06:42 - Max heap code 08:30 - Min heap code 10:12 - Using structure (user-defined) and comparator. In this video, we are explaining the STL container priority_queue using which min/max heap is implemented fast, also using priority queue for user defined datatypes is explained. This is very useful in competitive programming using which many types of problem can be solved. Code : https://ideone.com/XfMKl6 Practice Problem : https://www.codechef.com/COOK105B/problems/PEWDSVTS/ Solution Link : https://ideone.com/vAC3Mv For any queries: contact us at cp.gatecs@gmail.com Follow us on-- @facebook:- https://www.facebook.com/Quarantine-Engineers-107789377679897/ @linkedin :- https://www.linkedin.com/company/quarantine-engineers @instagram :-https://www.instagram.com/quarantine_engineers/ @telegram :-https://t.me/quarantine_engineers ********************** credits ************************ Edited by - mayanksneh60@gmail.com video : mixkit.co audio : mixkit.co text templates : mixkit.co music by : https://www.bensound.com/ #heap #priorityqueue #STL