Pagini recente » Cod sursa (job #561455) | Cod sursa (job #3268042) | Cod sursa (job #1958789) | Cod sursa (job #1989403) | Cod sursa (job #1018172)
#include <stdio.h>
#include <stdlib.h>
using namespace std;
long x[3000000],n,k;
void quick(int p,int u)
{
long pv,i,j,aux;
i=p;
j=u;
pv=x[(i+j)/2];
while(i<=j)
{
while(x[i]<pv)
i++;
while(pv<x[j])
j--;
if(i<=j)
{
aux=x[i];
x[i]=x[j];
x[j]=aux;
i++;
j--;
}
}
if(p<j)
quick(p,j);
if(i<u)
quick(i,u);
}
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
scanf("%ld", &n);
scanf("%ld", &k);
long i;
for(i=1;i<=n;i++)
scanf("%ld", &x[i]);
quick(1,n);
printf("%ld", x[k]);
return 0;
}