acwing 786 快速选择

题目：通过改进快速排序算法，得到一组数中第几大的数字

思路：每次递归排序一次后中间值

#include <iostream>
using namespace std;
const int N = 100010;
int q[N];
//快速选择复杂度O(2*n)
int quick_select(int l, int r, int k)
{
	if (l == r)
		return q[r];
	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)
		{
			int temp = q[j];
			q[j] = q[i];
			q[i] = temp;
		}
	}
	int len = j - l + 1;
	if (k <= len)
		return quick_select(l, j, k);
	else
		return quick_select(j + 1, r, k - len);
}
int main()
{
	int n, k;
	cin >> n >> k;
	for (int i = 0; i < n; i++)
	{
		cin >> q[i];
	}
	cout << quick_select(0, n - 1, k) << endl;
}