AcWing 786. 第k个数(java)【快速排序】

复习一下快排 学习一下输入输出

呜呜呜

加油

 

import java.util.*;

public class Main{
    private static int N = 100010;
    private static int[] q = new int[N];
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int k = scan.nextInt();
        for(int i = 0; i < n; i++){
            q[i] = scan.nextInt();
        }
        int l = 0, r = n - 1;
        System.out.println(quicksort(q, l, r, k - 1));
    }
    public static int quicksort(int[] q, int l, int r, int k){
        if(l == r) return q[l];
        
        int x = q[l + r >> 1];
        int i = l - 1;
        int j = r + 1;
        
        while(i < j){
            do i ++; while(q[i] < x);
            do j --; while(q[j] > x);
            if(i < j){
                int tmp = q[i];
                q[i] = q[j];
                q[j] = tmp;
            }
        }
        if(k <= j){
            return quicksort(q, l, j, k);
        }else{
            return quicksort(q, j + 1, r, k);
        }

    } 
}