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$