[Algorithm] How to use Max Heap to maintain K smallest items

NoSuchKey