<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>

class info{
    public:
    int j ;// it indicates ki ek arr ke kon se index pe hai
    int i;// it indicates ki 2d arr ke kon se wale arr mein hai 
    int val;
    info(int i,int j,int val){
        this->i=i;
        this->j=j;
        this->val=val;

    }
};
typedef pair<int,pair<int,int>> my_type;
class custom_comparator{
    public:
    bool operator()(info* a ,info* b){
        return a->val > b->val;
    }
};
class Solution {
public:
    vector<int> smallestRange(vector<vector<int>>& nums) {
        priority_queue<info*,vector<info*>,custom_comparator>pq;
    int maxi=INT_MIN;
    cout<<" yaha ";
        for(int i=0;i<nums.size();i++){
                pq.push(new info(i,0,nums[i][0]));
                maxi=max(maxi,nums[i][0]);
        }
        int mini =pq.top()->val;
        priority_queue<my_type,vector<my_type> ,greater<my_type> > range ;

        while(!pq.empty()){
            auto top_elem =pq.top();
            pq.pop();
            mini=top_elem->val;
            range.push({maxi-mini,{mini,maxi}});
            int arr_index=top_elem->i;
            int index=top_elem->j;
            if(index+1<nums[arr_index].size()){
                pq.push(new info(arr_index,index+1,nums[arr_index][index+1]));
                maxi=max(maxi,nums[arr_index][index+1]);
            }
            else{
                break;
            }
        }
        return {range.top().second.first,range.top().second.second};
        

    }
};
25443