[CSES][Sorting and Searching] Sliding Cost

[@harshexploring4922]

Your videos are really great. i feel lucky that I found your channel

[@neatlystructured]

So happy to hear that!

[@jeetipsandtricks2479]

you are doing really great work.your explanation is just awesome.thanks alot.

[@bldouyin4145]

13:21 Why begin? I thought the set was always sorted in ascending order so the median would be at the end of the leftset ...

[@todaytech7011]

yes set is sorted but you can't element from set using index you have to use iterator so begin iterator give the first element

[@neatlystructured]

If you look closer, you ll see that i used rbegin not begin. This means reverse begin and would give the largest element in the set. So you are right about your thinking, but we cannot use end because it is actually the end of the set and doesnt contain any value

[@madmax2442]

Thanks a lot! Really clever

[@neatlystructured]

you are very welcome!

[@anuragagarwal5776]

Thanks agian man!!
It helped a lot!

[@neatlystructured]

You are very welcome! My pleasure!

[@joshua_dlima]

thank you!

[@neatlystructured]

you are very welcome!

[@ANGELGARCIA-rk1qq]

Thank's man this is very usefull.

[@neatlystructured]

glad i could help!

[@techstuff9830]

How can we do it with ordered_set ?

[@neatlystructured]

why would we need an ordered_set?