Kth largest array element without array sort method, using min heap

Kth largest element

example:-

input:
array size=5
kth =3
arr[]={9 12 2 15 2}
output:
9




import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Ideone
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc=new Scanner(System.in);
		int size=sc.nextInt();
		int k=sc.nextInt();
		int[] arr=new int[size];
		
		for(int i=0;i<size;i++){
			arr[i]=sc.nextInt();
		}
		PriorityQueue<Integer> minhip=new PriorityQueue<>();
		for(int i:arr){
		        if(!minhip.contains(i)){
			minhip.add(i);
			}
			if(minhip.size()>k){
				minhip.remove();
			}
		}
		System.out.println(minhip.remove());
	}
}