Kth Smallest Element in a Sorted Matrix

Given an n×n matrix whose rows and columns are sorted in non-decreasing order, return the k-th smallest element (counting duplicates). The core challenge is to exploit the matrix's monotonic structure to avoid O(n^2) space/time — common efficient approaches use a size‑n heap or binary search on values with row-wise counting.