Untitled

class Solution {
public:
    int kthSmallest(vector<vector<int>>& mat, int k) {
        int n=mat.size();
        priority_queue<int,vector<int>,less<int>> pq; //maxheap
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                pq.push(mat[i][j]);
                if(pq.size()>k) pq.pop();
            }
        }
        return pq.top();
    }
};