Priority Queues:Kth largest element

import java.util.PriorityQueue;
public class Solution {

	public static int kthLargest(int arr[], int k) {
        if(arr.length==0)
            return Integer.MIN_VALUE;
		PriorityQueue<Integer> pq=new PriorityQueue<>();
        int i=0;
        for(;i<k;i++)
        {
            pq.add(arr[i]);
        }
        for(;i<arr.length;i++){
            int min=pq.element();//pq.peek;
            if(min<arr[i])
            {    pq.remove();
             pq.add(arr[i]);
            }
        }
        return pq.remove();
	}
}