机试——quick_sort找第k小值

题目链接：https://www.acwing.com/problem/content/788/

#include <iostream>
#include <cstdio>

using namespace std;

const int maxn = 1e5 + 5;

int a[maxn];

inline int quick_sort(int q[], int l, int r, int k) {
	if(l >= r) return q[l];
	
	int i = l - 1, j = r + 1, x = q[l + r >> 1];
	while(i < j) {
		do i ++; while(q[i] < x);
		do j --; while(q[j] > x);
		if(i < j) swap(q[i], q[j]);
	} 
	
	int len = j - l + 1;
	if(k <= len) return quick_sort(q, l, j, k);
	else return quick_sort(q, j + 1, r, k - len);
}

int main(void) {
	int n, k;
	scanf("%d%d", &n, &k);
	for(int i = 1; i <= n; i ++) scanf("%d", &a[i]);
	
	printf("%d\n", quick_sort(a, 1, n, k));
	
	return 0;
}

时间复杂度：O(n)