Minimize Maximum Height in Path

Given a m*n grid where each element represents a unique height, find a path from (0,0) to (m-1,n-1) such that the maximum height on this path is minimized. Implement this using the Dijkstra's algorithm. Example Input [[1,2,2],[3,8,2],[5,3,5]] Output 2