Pagini recente » Cod sursa (job #2796516) | Cod sursa (job #2808841) | Cod sursa (job #2600673) | Cod sursa (job #621243) | Cod sursa (job #2587897)
#include <iostream>
#include <fstream>
#define nmax 3000005
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int v[nmax];
void quicksort(int l,int r,int k)
{
if(l>=r)
return;
int i=l-1,j=r+1,m,t;
int piv=rand() % (r - l + 1) + l;
while(1)
{
do
{
i++;
}
while(v[i]<v[piv]);
do
{
j--;
}
while(v[j]>v[piv]);
if(i<j)
swap(v[i],v[j]);
else
{
t=j;
break;
}
}
m=t-l+1;
if(m>=k)
quicksort(l,t,k);
else
quicksort(t+1,r,k-m);
}
int main()
{
ios::sync_with_stdio(false);
f.tie(nullptr);
g.tie(nullptr);
int n,k;
f>>n>>k;
for(int i=1; i<=n; i++)
f>>v[i];
quicksort(1,n,k);
g<<v[k];
return 0;
}