快速排序思想,加一个优化就过了。
#include <stdio.h>
#include <algorithm>
using namespace std;
int a[1000005*5];
int n, k;
int ans = 0;
void quicksort(int l, int r, int val)
{
if(l >= r) return ;
int left = l, right = r;
int mid = (left + right) >> 1;
if(a[left] > a[mid]) swap(a[left], a[mid]);
if(a[mid] > a[right]) swap(a[mid], a[right]);
if(a[mid] > a[left]) swap(a[left], a[mid]);
int tmp = a[left];
while(l < r)
{
while(a[r] >= tmp && r > l)
{
--r;
}
a[l] = a[r];
while(a[l] <= tmp && l < r)
{
++l;
}
a[r] = a[l];
}
a[l] = tmp;
if((n-val) >= l)
quicksort(l+1, right, val);
else
quicksort(left, l-1, val);
}
int main()
{
while(~scanf("%d %d", &n, &k))
{
for(int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
quicksort(0, n-1, k);
printf("%d\n", a[n-k]);
}
return 0;
}