Pagini recente » Cod sursa (job #2954911) | Cod sursa (job #155252) | Cod sursa (job #1244278) | Cod sursa (job #3207980) | Cod sursa (job #1419933)
#include <stdio.h>
#include <algorithm>
int a[3000000];
FILE *f=fopen("sdo.in","r");
FILE *g=fopen("sdo.out","w");
int Select(int A[],int k,int l,int r){
int i, j, m;
i=l;
j=r;
if(l==r) return A[k];
else{
m=a[(l+r)/2];
while(i<j){
while(a[i]<m)i++;
while(a[j]>m)j--;
if(i<j){
std::swap(a[i],a[j]);
i++; j--;
}
}
if(k < j) return Select(A,k,l,j);
else return Select(A,k,i,r);
}
}
int main(){
long int n, k;
fscanf(f,"%ld%ld",&n,&k);
for(int i=0;i<n;i++){
fscanf(f,"%d",&a[i]);
}
fprintf(g,"%d",Select(a,k-1,0,n-1));
return 0;
}