You are given a two-dimensional array in which each individual row is already sorted in ascending order, although there is no required ordering between different rows. Implement a function that efficiently returns the k-th largest element from the entire matrix. The solution should leverage the fact that each row is sorted while accounting for the lack of ordering across rows.