Pagini recente » Cod sursa (job #3128196) | Cod sursa (job #476412) | Cod sursa (job #445082) | Cod sursa (job #2040639) | Cod sursa (job #1499836)
//#include <iostream>
#include <fstream>
//#include <ctime>
//#include <stdlib.h>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int a[3000005],k,n;
/*
void ord(long st,long dr)
{ long pivot = rand()%(dr-st+1)+st;
swap(a[pivot],a[st]);
long i,j,x=a[st];
i=st;
j=dr+1;
while(i<=j)
{do{j--;}while(a[j]>x);
do{i++;}while(a[i]<x);
if(i<=j) swap(a[i],a[j]);
}
if(j>st && k<=j)ord(st,j);
if(i<dr && k>=i)ord(i,dr);
}*/
int main()
{int i;
//srand(time(0));
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
// ord(1,n);
nth_element(a+1,a+k,a+n+1);
fout<<a[k];
}