主要思想:分治
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
int[] q = new int[n];
for (int i = 0; i <q.length; i++)
q[i] = in.nextInt();
System.out.print(quick_sort(q,0, n - 1, k));
}
// 圈1和圈2与快排一样 具体参考上篇博客
public static int quick_sort(int[] q ,int l,int r,int k){
if(l==r) return q[l];
int x=q[l],i=l-1,j=r+1;
while(i<j){
while(q[++i]<x);
while(q[--j]>x);
if(i<j){
int temp = q[i];
q[i] = q[j];
q[j] = temp;
}
}
int sl =j-l+1; //SL的长度为(分界点 - 左边界 + 1)
if(k<=sl) return quick_sort(q,l,j,k); // 满足在左边
return quick_sort(q,j+1,r,k-sl);//满足在右边
}
}