Pagini recente » Cod sursa (job #454034) | Cod sursa (job #469853) | Cod sursa (job #263789) | Cod sursa (job #94175) | Cod sursa (job #1308547)
#include<iostream>
#include<fstream>
using namespace std;
int a[3000000],n,k,s;
void poz (int li,int ls,int &s,int a[3000000])
{
int i=li,j=ls,c,i1=0,j1=-1;
while (i<j)
{
if (a[i]>a[j])
{
c=a[j]; a[j]=a[i]; a[i]=c;
c=i1; i1=-j1; j1=-c;
}
i=i+i1;
j=j+j1;
}
s=i;
}
void quick (int li,int ls)
{
if(li<ls)
{
poz(li,ls,s,a);
quick(li,s-1);
quick(s+1,ls);
}
}
main()
{
int i;
ifstream f("sdo.in");
ofstream g("sdo.out");
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
quick(1,n);
g<<a[k];
}