Kth smallest element

class Solution
{
    public:
    int kthSmallest(int arr[], int l, int r, int k) 
    {
        priority_queue<int>q;
        int count=0;
        for(int i=l;i<=r;i++)
        {
            q.push(arr[i]);
            count++;
            if(count>k)
            {
                q.pop();
            }
        }
        return q.top();
    }
};