Hello. This is a CSES problem: [Sliding Median](https://cses.fi/problemset/task/1076). My logic is to have a sorted structure which can store multiple keys in sorted order and then I'll take middle of that data structure and then remove by index and do it again. So my time complexity analysis is: O(nlog(n)) ↵
↵
I thought of PBDS. Inserting and sorting is find but how to have multiple keys. Using less_equals is not working for me. Is there anything I can do with PBDS or I need to think of some other logic.↵
↵
[My Code with PBDS](https://pastebin.com/TZEcExSu) I have printed the set so to analyze what was going on.↵
↵
PS: Please don't tell me the logic just help me with the PBDS and this logic otherwise I'll think about something else then :)
↵
I thought of PBDS. Inserting and sorting is find but how to have multiple keys. Using less_equals is not working for me. Is there anything I can do with PBDS or I need to think of some other logic.↵
↵
[My Code with PBDS](https://pastebin.com/TZEcExSu) I have printed the set so to analyze what was going on.↵
↵
PS: Please don't tell me the logic just help me with the PBDS and this logic otherwise I'll think about something else then :)
