Pagini recente » Istoria paginii runda/amberheard | Cod sursa (job #1868967) | Istoria paginii runda/simulare-cartita-30 | Cod sursa (job #2471376) | Cod sursa (job #2306587)
#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 b,int c)
{
int i=b-1,j=c+1,p=a[b+(rand()%(c-b+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 i,int j,int k)
{
if(i==j)
return;
int q=P(a,i,j),t=q-i+1;
t>=k?S(a,i,q,k):S(a,q+1,j,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];
}