Least Recently Used cache using C++

Question

I am trying to implement LRU Cache using C++ . I would like to know what is the best design for implementing them. I know LRU should provide find(), add an element and remov

Answer 1

When you say priority, I think "heap" which naturally leads to increase-key and delete-min.