Pagini recente » Cod sursa (job #1857329) | Cod sursa (job #2340384) | Cod sursa (job #624447) | Cod sursa (job #823151) | Cod sursa (job #1349372)
#include <ctime>
#include <cstdlib>
#include <cstdio>
using namespace std;
int N,K,a[3000010];
void swp(int i,int j){
int aux=a[i];
a[i]=a[j];
a[j]=aux;
}
int part(int l, int r){
int ind=l+(rand()%(r-l+1));
int val=a[ind];
int c=l;
swp(ind,r);
for (int i=l; i<r; i++)
if (a[i]<val){
swp(i,c);
c++;
}
swp(r,c);
return c;
}
int sel(int l, int r, int k){
if (l==r)
return a[l];
int q=part(l,r);
if (k==q-l+1) return a[q];
else if (q-l+1<k) return sel(q+1,r,k-q+l-1);
else return sel(l,q-1,k);
}
int main(){
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%d %d",&N,&K);
srand(time(NULL));
int i;
for (i=1; i<=N; i++) scanf("%d",&a[i]);
printf("%d\n",sel(1,N,K));
return 0;
}