Event list data structure

I need to implement an event list in python, where each element is an event that has an associated timestamp. 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.

I am aware of the bisect module, however, it doesn't permit to insert of arbitrary items in the list. Hence I feel that perhaps I could execute the occasion list with two unique python

a bisect list containing all the timestamps
a dictionary with the timestamps as the keys and the events as value
Inserting and retrieving is straightforward.

Do you feel that there is a more effective approach?

[jay (support)]

Just append the new item, then sort the list. Then the item at index 0 is the oldest (assuming you sort on date ascending).

If you sort the list in descending, then you just get the last item (list.pop()) which would be the oldest.

We can help with a more complete answer if you'd give us more specific details (what is an "event" exactly for instance).

[jay (support)]

[MODERATOR NOTE]: moved to a more appropriate forum.