title: STL container to use for deleting a range of values
body: <p>I have with myself <code>n</code> integers. I am given with <code>starting value(SV)</code> and <code>ending value(EV)</code>, I need to delete the values that lie within the range of these values. The starting value as well the ending value may not exist in the set of n integers. This I need to do in <code>O(No. Of elements deleted)</code>. Container such as <code>vector</code> of integers is failing since I need to B.Search and get the iterator that is greater than equal to the <code>SV</code> and for <code>EV</code> as well which takes an additional time of <code>Log n</code>. Any approach appreciated.</p>
  
  <p>Edit : I was even thinking of using maps, storing the values as keys, and erasing on the basis of those key values. But the problem again is that the operation <code>lower_bound</code> and <code>upper_bound</code> occur in <code>log</code> time.</p>