Pagini recente » Cod sursa (job #1195731) | Cod sursa (job #1914680) | Cod sursa (job #2497934) | Cod sursa (job #1904168) | Cod sursa (job #2183465)
#include <fstream>
#include <ctime>
#include <stdlib.h>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int n, v[3000001], i,p,k;
int rez(int st, int dr)
{
int dst=0, ddr=-1;
while(st!=dr)
{
if(v[st]>v[dr])
{
swap(v[st], v[dr]);
swap(dst, ddr);
ddr=-ddr;dst=-dst;
}
st+=dst;
dr+=ddr;
}
return st;
}
void quicksort(int st, int dr)
{
int p;
if(st<dr)
{
p=rez(st, dr);
quicksort(st, p-1);
quicksort(p+1, dr);
}
}
int main()
{
srand(time(0));
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=n;i>1;i--)
{
p=1+1LL*(rand()*rand())%(i-1);
swap(v[i], v[p]);
}
quicksort(1, n);
fout<<v[k];
fin.close();
fout.close();
return 0;
}