Median of a Row Wise Sorted Matrix

Given an R×C matrix where each row is sorted in non-decreasing order, find the median (the middle element if the matrix were flattened) without fully sorting all elements. The typical solution uses binary search on the value range and counts, for each candidate, how many elements in each row are ≤ that value to locate the median efficiently.