Pagini recente » Cod sursa (job #1089254) | Cod sursa (job #2641090) | Cod sursa (job #1522634) | Cod sursa (job #1432367) | Cod sursa (job #1803405)
#include<cstdio>
#include<cstdlib>
#include<ctime>
using namespace std;
int v[3000001];
void swp(int i,int j)
{
int aux=v[i];
v[i]=v[j];
v[j]=aux;
}
void merg(int st,int dr,int k)
{
int piv=st+rand()%(dr-st+1);
int i=st,j=dr,p=v[piv];
int temp=piv;
while(i<j)
{
while(v[i]<p)
i++;
while(v[j]>p)
j--;
if(i<j)
{
if(v[i]==p)
{
temp=j;
}
if(v[j]==p)
{
temp=i;
}
swp(i,j);
i++;
j--;
}
}
if(temp<j)
swp(temp,j);
if(temp>i)
swp(temp,i);
if(i>k)
{
merg(st,i-1,k);
}
else
{
if(j<k)
{
merg(j+1,dr,k);
}
}
}
int main()
{
freopen("sdo.in","r",stdin);
freopen("sdo.out","w",stdout);
srand(time(0));
int n,k,i;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
}
v[n+1]=2000000000;
merg(1,n,k);
printf("%d",v[k]);
return 0;
}