题目链接:https://www.acwing.com/problem/content/description/788/
题目如下:
#include <iostream>
#include <algorithm>
using namespace std;
const int N=100010;
int arr[N];
int main(){
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++) cin>>arr[i];
cout<<quick_select(arr,0,n-1,k)<<endl;
return 0;
}
void quick_select(int arr[],int l,int r,int k){
if(l==r) return arr[l];
int partval=arr[(l+r)>>1];
int i=l-1,j=r+1;
while(i<j){
do ++i;while(arr[i]<partval);
do --j;while(arr[j]>partval);
if(i<j) swap(arr[i],arr[j]);
}
int len=j-l+1;
if(k<=len) return quick_select(arr,l,j,k);
return quick_select(arr,j+1,r,k-len);
}