In this video we will learn about std::priority_queue in C++ STL. NOTES: 0. std::priority_queue is a container adaptor that provides constant time lookup of the …
Tag: priority queue c++, [vid_tags]
Xem thêm: https://meohay360.com/category/internet
Nguồn: https://meohay360.com
Internet
std::priority_queue In C++
21
Th3
Th3
Your habit of keeping the notes in description is really really helpful sir!
God<Bless> You;
Use " using namespace std; " please 😀
Great explanation. Can you share how you made this video, how you were able to write with marker on code editor.
Thanks a lot for the video but I have a few questions:
1. First of all, if we want to order something in ascending order then it is the by default thing or we can pass `std::less` operator. But, here to sort everything, we are passing `std::greater` operator! Doesn't it seem strange?
2. As you mentioned, to sort in ascending order we have to write like: `std::priority_queue<int, std::vector<int>, std::greater<int> >` But, why are we passing `std::vector<int>` and not just `std::greater<int>`? In the case of vector, we just pass `std::greater`, right?
And if we have to pass `std::vector<int>` then why that's not the case with descending order? I mean by default it will assume `std::less<int>` operator but what about `std::vector<int>`? It will assume that one too?
Thanks in advance!
sir, that lambda syntax is not clear to me .. can you please explain it ..
Sir please make the complete series on ds and algo actually I have completed all the data structures videos .
JAJAJA buen tutorial, hablas muy rapido amigo, y como no se muy bien ingles tuve que realentizar el video xd, pero aun asi buena explicación
Wat software do u use for writing with hand
Your videos explained with code is really helpful!! thankzz a lot…Best wishes to you and keep doing the good work!!!!!!!
what software you use to draw over vs code?
Wow..this was exactly I was stuck in for a day to understand…made it really In lucid language and easy to understand…thanks a lot
love that sad face~!
it was the missing link between me and the HEAPS
by default internally it used vector<> but in min heap example why did u used vector<> as internal?
how to use vector and greater syntax in
priority_queue <pair<int,int> >pQQ;
Why you using "n" instead of std::endl? What the difference behind them and what is best to use?
I love your videos.and i started programming last year..Can u make a video on how to use cpp for competitive programming.that will be very helpful..or recommend questions on stl topics and data structures.for practice.🙏🙏
I have watched and liked most of the videos on your channel and i can say by far. You're one of the best teachers when it comes to competitive coding. Is it possible to have a playlist on "Design and Analysis of Algorithms in C++"?