Pagini recente » Cod sursa (job #1132187) | Cod sursa (job #1899945) | Cod sursa (job #2805464) | Cod sursa (job #2701422) | Cod sursa (job #1019874)
#include <fstream>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int ok;
long n,k;
long a[200000000];
long poz(int p,int u)
{long aux,piv,x;
piv=a[p];
while(p<u)
{
if(a[p]>a[u])
{
aux=a[p];
a[p]=a[u];
a[u]=aux;
}
if(a[p]==piv)
u--;
else p++;
}
x=p;
return x;
}
void quick(int p,int u)
{ long x;
if(p<u&&ok==1)
{
x=poz(p,u);
if(x==k)
{g<<a[k];
ok=0;
}
quick(p,x-1);
quick(x+1,u);
}
}
int main()
{long i;
ok=1;
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>a[i];
}
quick(1,n);
g.close();
return 0;
}