Pagini recente » Cod sursa (job #1054605) | Istoria paginii runda/backsigeneratordetesteorelse | Cod sursa (job #1204070) | Cod sursa (job #2977934) | Cod sursa (job #2616317)
#include<cstdio>
#include<algorithm>
using namespace std;
FILE*in=fopen("sdo.in","r");
FILE*out=fopen("sdo.out","w");
int n,k,v[3000003],i,it1,it2,p=1,x,y;
int main()
{
fscanf(in,"%d%d",&n,&k);
for(i=1;i<=n;i++)
{
fscanf(in,"%d",&v[i]);
}
x=1;
y=n;
while(p!=k)
{
p=(x+y)/2;
it1=x;
it2=y;
while(it1<it2)
{
while(v[it2]>v[p])
{
it2--;
}
swap(v[it2],v[p]);
p=it2;
if(it1>=it2)
{
break;
}
while(v[it1]<v[p])
{
it1++;
}
swap(v[it1],v[p]);
p=it1;
}
if(p>k)
{
y=p-1;
}
else
{
x=p+1;
}
}
fprintf(out,"%d",v[p]);
}