378. Kth Smallest Element in a Sorted Matrix. O(n^2 * log(n)) time. O(n) space. Binary heap.
378. Kth Smallest Element in a Sorted Matrix. O(n^2 * log(n)) time. O(n) space. Binary heap.

chrisxue815/leetcode_python