Given an m $ imes$ n matrix grid of integers where each row is sorted in nondecreasing order, return the median of the matrix.

Both m and n are odd integers, which guarantees that the total number of elements in the matrix is odd and the median is unique.

Constraints:

• m == grid.length

• n == grid[i].length

• $1 \leq$ m, n $\leq 500$

• m and n are both odd.

• $1 \leq$ grid[i][j] $\leq 10^6$

• grid[i] is sorted in nondecreasing order.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.