This would probably be implemented as a tree or something? My point is it needs to be efficient.
Depends why you need it. For instance, if you only need the top element, this binary heap might be okay for you. Otherwise, implement a binarySearch and insertSorted functions for arrays, should not be more than ten-fifteen lines. Unless you plan on having thousands upon thousands of elements; then it makes more sense to just insert in bulk and then sort using the builtin.
How about a simple array, sorted after each update?
©2020 All rights reserved.