Data structure for cache design with efficient insertion, deletion and extraction of the highest value

Question

I need to implement a cache with regular cache operations, along with the ability to quickly retrieve the maximum element from the cache.

Can you suggest data structures to implement this?

I thought of using a hash map along with a list to keep the minimum element.

Suggest other approaches with better complexity.

Answer 1

heap is great for quickly restoring the maximum element.

Answer 2

, lookaside, . N (- 8 ), ( ) :

[list N]
[list N*2]
[list N*4]
[list N*8]
...

. , (S), LOG2 (S/N) , , . ( ) , , , .