# ---
# title: 378. Kth Smallest Element in a Sorted Matrix
# id: problem378
# author: Tian Jun
# date: 2020-10-31
# difficulty: Medium
# categories: Binary Search, Heap
# link: <https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/description/>
# hidden: true
# ---
# 
# 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 ≤ n2.
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
