import java.util.*;
public class Main {
public int solution(int[] arr,int n,int k) {
quicksort(arr,0,n-1);
return arr[n-k];
}
public void quicksort(int[] arr,int start,int end){
if(start < end){
int key = arr[start];
int i = start,j = end;
while(start < end){
//右边找小的
while(start < end && arr[end] >= key){
end--;
}
if(start < end){
arr[start] = arr[end];
start++;
}
//左边找大的
while(start<end && arr[start] <= key){
start++;
}
if(start < end){
arr[end] = arr[start];
end--;
}
}
arr[start] = key;
quicksort(arr,i,start-1);
quicksort(arr,start+1,j);
}
}
}