Package g1401_1500.s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows

Class Solution

java.lang.Object
g1401_1500.s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows.Solution
public class Solution extends Object
1439 - Find the Kth Smallest Sum of a Matrix With Sorted Rows.<p>Hard</p> <p>You are given an <code>m x n</code> matrix <code>mat</code> that has its rows sorted in non-decreasing order and an integer <code>k</code>.</p> <p>You are allowed to choose <strong>exactly one element</strong> from each row to form an array.</p> <p>Return <em>the</em> <code>k<sup>th</sup></code> <em>smallest array sum among all possible arrays</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> mat = [[1,3,11],[2,4,6]], k = 5</p> <p><strong>Output:</strong> 7</p> <p><strong>Explanation:</strong> Choosing one element from each row, the first k smallest sum are: [1,2], [1,4], [3,2], [3,4], [1,6]. Where the 5th sum is 7.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> mat = [[1,3,11],[2,4,6]], k = 9</p> <p><strong>Output:</strong> 17</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> mat = [[1,10,10],[1,4,5],[2,3,6]], k = 7</p> <p><strong>Output:</strong> 9</p> <p><strong>Explanation:</strong> Choosing one element from each row, the first k smallest sum are: [1,1,2], [1,1,3], [1,4,2], [1,4,3], [1,1,6], [1,5,2], [1,5,3]. Where the 7th sum is 9.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>m == mat.length</code></li> <li><code>n == mat.length[i]</code></li> <li><code>1 <= m, n <= 40</code></li> <li><code>1 <= mat[i][j] <= 5000</code></li> <li><code>1 <= k <= min(200, n<sup>m</sup>)</code></li> <li><code>mat[i]</code> is a non-decreasing array.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • kthSmallest

      public int kthSmallest(int[][] mat, int k)