title: Event list data structure in python
body: <p>I need to implement an event list in python, where each element is an event that has an associated timestamps. The actions that I need to perform are essentially two: inserting in the right order (decreasing timestamps), and retrieving the event with the smaller start time.</p>
  
  <p>I am aware of the bisect module, but it doesn't allow to insert arbitrary items in the list. For this reason I think that maybe I could implement the event list with two different python data structures:</p>
  
  <ul>
  <li>a bisect list containing all the timestamps</li>
  <li>a dictionary with the timestamps as the keys ans the events as value</li>
  </ul>
  
  <p>Inserting and retrieving are straightforward.</p>
  
  <p>Do you think that there is a more efficient approach?</p>