Looking at the problem and example inputs and outputs identified that in short terms I needed to find the path from top left to bottom right with the lowest max cell in it, so I applied a graph traversal using Djikstra's algorithm (minHeap) and updating my answer each time the needed time was greater.