4.7 选择随机算法

codeup

题号：10000587

A题 :求第k大数

题目链接：http://codeup.cn/problem.php?cid=100000587&pid=0

#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <algorithm>
using namespace std;
const int maxn=100010;
int A[maxn],n;
int randPartition(int A[],int left,int right) {
	int p=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=right-p+1;
	if(K==M) return A[p];
	if(K<M) return randSelect(A, p+1, right, K);//往右边找
	else if(K>M) return randSelect(A, left, p-1, K-M);//往左边找
}
int main(){
	srand((unsigned)time(NULL));
	int sum=0,sum1=0;
	int a[maxn];
	scanf("%d",&sum);
	scanf("%d",&sum1);
	for(int i=0;i<sum;i++){
		scanf("%d",&a[i]);
	}
	int res=randSelect(a,0,sum-1,sum1);
    printf("%d",res);

}