Kth smallest array element using max heap

kth smallest array element

Example:-
input:
array size=5
kth number =2
arr[]={9,2,15,3,16}


/* package whatever; // don't place package name! */

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<>((a,b)->b-a);
		for(int i:arr){
		        if(!minhip.caontains(i)){
			minhip.add(i);
			}
			if(minhip.size()>k){
				minhip.remove();
			}
		}
		System.out.println(minhip.remove());
	}
}