Pagini recente » Cod sursa (job #1745987) | Cod sursa (job #1667780) | Cod sursa (job #884863) | Cod sursa (job #3233160) | Cod sursa (job #2306583)
#include<fstream>
#include<ctime>
using namespace std;
#define M 3000001
ifstream f("sdo.in");
ofstream g("sdo.out");
int a[M],n,k,i;
int P(int a[],int li,int lf)
{
int i=li-1,j=lf+1,p=a[li+(rand()%(lf-li+1))];
while(1)
{
do
{
++i;
} while(a[i]<p);
do
{
--j;
} while(p<a[j]);
if(i<j)
swap(a[i],a[j]);
else
return j;
}
return 0;
}
void S(int a[],int li,int lf,int k)
{
if(li==lf)
return;
int q=P(a,li,lf);
int t=q-li+1;
if(t>=k)
S(a,li,q,k);
else
S(a,q+1,lf,k-t);
}
int main()
{
for(srand(time(NULL)),f>>n>>k,i=1;i<=n;i++)
f>>a[i];
S(a,1,n,k),g<<a[k];
}