title: Data structure (in STL or Boost) for retrieving kth smallest/largest item in a set?
body: <p>I am looking for a data structure in C++ STL or boost with the following properties:</p>
  
  <ul>
  <li>Retrieval of kth largest item in O(log n) time</li>
  <li>Searching in O(log n) time</li>
  <li>Deletion in O(log n) time</li>
  </ul>
  
  <p>If such a data structure implementation doesn't exist, is there a way to adapt a different data structure with extra data (e.g., set) so that the above is possible?</p>
  
  <p>Note: I've found <a href="https://stackoverflow.com/questions/23906274/is-there-any-data-structure-in-c-stl-for-performing-insertion-searching-and-r">is-there-any-data-structure-in-c-stl-for-performing-insertion-searching-and-r</a>, but this is 5 years old and doesn't mention boost.</p>