Shayan's blog

By Shayan, 3 months ago, In English
  • Vote: I like it
  • +7
  • Vote: I do not like it

»
3 months ago, # |
Rev. 3   Vote: I like it -20 Vote: I do not like it

now not chill kids

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

wrong video isnt it?

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Is there a container that always maintains the elements in sorted order, allows me to access any k-th largest/smallest element in O(log n) complexity, and also supports insertion and deletion of elements in O(log n) complexity? THANKS~~