<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>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> mat = [[1,3,11],[2,4,6]], k = 5
<strong>Output:</strong> 7
<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.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> mat = [[1,3,11],[2,4,6]], k = 9
<strong>Output:</strong> 17
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> mat = [[1,10,10],[1,4,5],[2,3,6]], k = 7
<strong>Output:</strong> 9
<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.  
</pre>

<p>&nbsp;</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 &lt;= m, n &lt;= 40</code></li>
	<li><code>1 &lt;= mat[i][j] &lt;= 5000</code></li>
	<li><code>1 &lt;= k &lt;= min(200, n<sup>m</sup>)</code></li>
	<li><code>mat[i]</code> is a non-decreasing array.</li>
</ul>

class Solution {
public:
//https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/solutions/3787031/understanding-the-power-of-heap-data-structure-step-by-step/
    vector<int> ksmallmerge(vector<int>&a, vector<int>&b,int k ){
        priority_queue<vector<int>,vector<vector<int>>,greater<vector<int>>>pq;

        int n = a.size();
        int m = b.size();
        int i;

        for(i=0;i<min(k,m);i++){
            pq.push({a[0]+b[i], 0, i});
        }

        vector<int>res;

        while(k-- && !pq.empty()){
            vector<int>v = pq.top();
            pq.pop();

            int sum = v[0];
            int idx1 = v[1];
            int idx2 = v[2];

            res.push_back(sum);

            if(idx1+1 < n){
                pq.push({a[idx1+1] + b[idx2], idx1+1, idx2});
            }
        }
        return res;
    }
    int kthSmallest(vector<vector<int>>& mat, int k) {
        vector<int>res;
        res = mat[0];
        int i;
        for(i=1;i<mat.size();i++){
            res = ksmallmerge(res,mat[i],k);
        }

        for(i=0;i<res.size();i++){
            cout<<res[i]<<" ";
        }

        return res[res.size()-1];
    }
};
21646