<p>You have <code>k</code> lists of sorted integers in <strong>non-decreasing&nbsp;order</strong>. Find the <b>smallest</b> range that includes at least one number from each of the <code>k</code> lists.</p>

<p>We define the range <code>[a, b]</code> is smaller than range <code>[c, d]</code> if <code>b - a &lt; d - c</code> <strong>or</strong> <code>a &lt; c</code> if <code>b - a == d - c</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [[4,10,15,24,26],[0,9,12,20],[5,18,22,30]]
<strong>Output:</strong> [20,24]
<strong>Explanation: </strong>
List 1: [4, 10, 15, 24,26], 24 is in range [20,24].
List 2: [0, 9, 12, 20], 20 is in range [20,24].
List 3: [5, 18, 22, 30], 22 is in range [20,24].
</pre>

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

<pre>
<strong>Input:</strong> nums = [[1,2,3],[1,2,3],[1,2,3]]
<strong>Output:</strong> [1,1]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>nums.length == k</code></li>
	<li><code>1 &lt;= k &lt;= 3500</code></li>
	<li><code>1 &lt;= nums[i].length &lt;= 50</code></li>
	<li><code>-10<sup>5</sup> &lt;= nums[i][j] &lt;= 10<sup>5</sup></code></li>
	<li><code>nums[i]</code>&nbsp;is sorted in <strong>non-decreasing</strong> order.</li>
</ul>

struct node{
    int id;
    int idx;
    node(int id,int idx):id(id),idx(idx){}
};
class Solution {
public:
    vector<int> smallestRange(vector<vector<int>>& nums) {
        auto comp=[&nums](node* a,node* b){
            return nums[a->id][a->idx]>nums[b->id][b->idx];
        };
        priority_queue<node*,vector<node*>,decltype(comp)>pq(comp);
        int maxi=INT_MIN;
        int mini=INT_MAX;
        int k=nums.size();
        for(int i=0;i<k;i++){
            maxi=max(maxi,nums[i][0]);
            mini=min(mini,nums[i][0]);
            pq.push(new node(i,0));
        }
        int start=mini,end=maxi;
        while(!pq.empty()){
            node* temp=pq.top();
            pq.pop();
            int id=temp->id;
            int idx=temp->idx;
            delete temp;
            mini=nums[id][idx];
            if(maxi-mini<end-start){
                start=mini;
                end=maxi;
            }
            else if(maxi-mini==end-start&&mini<start){
                start=mini;
                end=maxi;
            }
            if(idx+1<nums[id].size()){
                maxi=max(maxi,nums[id][idx+1]);
                pq.push(new node(id,idx+1));
            }
            else{
                break;
            }
        }
        while(!pq.empty()){
            node* temp=pq.top();
            pq.pop();
            
            delete temp;
        }
        return {start,end};
    }
};
23361