3种做法,
1.最简单,sort排完序,然后输出下表k-1,但是复杂度最高
2.堆排序(大根堆)
#include<iostream>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
const int maxn=100000;
int a[maxn];
int main(){
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++)
cin>>a[i];
priority_queue<int , vector<int> , less<int> > q;//大根堆
for(int i=0;i<n;i++){
q.push(a[i]);
if(q.size() > k) q.pop();
}
cout<<q.top();
return 0;
}
3.快速排序(随机选择算法)也可以不随机但是 随机的期望时间复杂度低,
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
//int Partition(int a[],int left ,int right){
// int temp=a[left];
// while(left < right){t;
// while(left < right && a[right] > temp) right--;
// a[left] = a[right];
// while(left < right && a[left] <=temp) left++;
// a[right] =a[left];
// }
// a[left] = temp ;
// return lef
//}
//void quickSort(int a[], int left ,int right){
// if(left <right){
// int pos=Partition(a,left,right);
// quickSort(a,left,pos-1);
// quickSort(a,pos+1,right);
// }
//}
int randPartition(int a[], int left ,int right){
int p=(round(1.0 * rand() / RAND_MAX *(right - left)+left));
swap(a[p],a[left]);
int temp=a[left];
while(left < right){
while(left < right && a[right] > temp) right--;
a[left] = a[right];
while(left < right && a[left] <=temp) left++;
a[right] =a[left];
}
a[left] = temp ;
return left;
}
int randSelect(int a[],int left,int right ,int k){
if(left == right ) return a[left];
int p= randPartition(a,left,right);
int m=p-left+1;
if(k==m) return a[p];
if(k<m){
return randSelect(a,left,p-1,k);
}
else {
return randSelect(a,p+1,right,k-m);
}
}
int main(){
int a[6] = {5,12,7,2,9,3};
cout<<randSelect(a,0,5,5);
return 0;
}