Package g1401_1500.s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1439 - Find the Kth Smallest Sum of a Matrix With Sorted Rows\.

    Hard

    You are given an m x n matrix mat that has its rows sorted in non-decreasing order and an integer k.

    You are allowed to choose exactly one element from each row to form an array.

    Return the <code>k<sup>th</sup></code> smallest array sum among all possible arrays.

    Example 1:

    Input: mat = \[\[1,3,11],2,4,6], k = 5

    Output: 7

    Explanation: 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.

    Example 2:

    Input: mat = \[\[1,3,11],2,4,6], k = 9

    Output: 17

    Example 3:

    Input: mat = \[\[1,10,10],1,4,5,2,3,6], k = 7

    Output: 9

    Explanation: 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.

    Constraints:

    • m == mat.length

    • n == mat.length[i]

    • 1 &lt;= m, n &lt;= 40

    • 1 &lt;= mat[i][j] &lt;= 5000

    • <code>1 <= k <= min(200, n<sup>m</sup>)</code>

    • mat[i] is a non-decreasing array.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer kthSmallest(Array<IntArray> mat, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait