Find the $k^{th}$ smallest element in an $(n \times n)$ matrix, where each row and column of the matrix is sorted in ascending order.

Although there can be repeating values in the matrix, each element is considered unique and, therefore, contributes to calculating the $k^{th}$ smallest element.

Constraints:

• n $==$ matrix.length
• n $==$ matrix[i].length
• $1\leq$ n $\leq100$
• $-10^3\leq$ matrix[i][j] $\leq10^3$
• $1\leq$ k $\leq n^2$

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 main.py in the following coding playground.