Problem Statement

In an m x n matrix, you need to find a path from the top-left corner (0, 0) to the bottom-right corner (m-1, n-1).

Each path has a cost, which is defined as the maximum value encountered along that path.

Your task is to return the minimum cost for any such possible path.