Pagini recente » Cod sursa (job #1893439) | Cod sursa (job #387993) | Cod sursa (job #3224493) | Cod sursa (job #1437681) | Cod sursa (job #1268186)
#include <stdio.h>
#include <stdlib.h>
#define MAXN 3000000
int v[MAXN+1], k;
void my_Nth_element(int begin, int end){
int st=begin, dr=end, pivot=v[begin+rand()%(end-begin+1)], aux;
while(v[st]<pivot){
st++;
}
while(v[dr]>pivot){
dr--;
}
while(st<=dr){
aux=v[st];
v[st]=v[dr];
v[dr]=aux;
do{
st++;
}while(v[st]<pivot);
do{
dr--;
}while(v[dr]>pivot);
}
if((st<=k)&&(st<end)){
my_Nth_element(st, end);
}
if((dr>=k)&&(dr>begin)){
my_Nth_element(begin, dr);
}
}
int main(){
int i, n;
FILE *fin, *fout;
fin=fopen("sdo.in", "r");
fout=fopen("sdo.out", "w");
fscanf(fin, "%d%d", &n, &k);
for(i=1; i<=n; i++){
fscanf(fin, "%d",&v[i]);
}
my_Nth_element(1, n);
fprintf(fout, "%d\n", v[k]);
fclose(fin);
fclose(fout);
return 0;
}