problem378

README

< Previous 　　　　　　　　　　　　　　　　 Next >

378. Kth Smallest Element in a Sorted Matrix (Medium)

Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.

Note that it is the kth smallest element in the sorted order, not the kth distinct element.

Example:

matrix = [
   [ 1,  5,  9],
   [10, 11, 13],
   [12, 13, 15]
],
k = 8,
return 13.

Note:
You may assume k is always valid, 1 ≤ k ≤ n².

Related Topics

[Heap] [Binary Search]

Similar Questions

1. Find K Pairs with Smallest Sums (Medium)
2. Kth Smallest Number in Multiplication Table (Hard)
3. Find K-th Smallest Pair Distance (Hard)
4. K-th Smallest Prime Fraction (Hard)