Pagini recente » Cod sursa (job #522924) | Cod sursa (job #413467) | Cod sursa (job #815619) | Cod sursa (job #2067985) | Cod sursa (job #1016138)
#include<iostream>
#include<fstream>
using namespace std;
long long k,a[30000001],nr,n;
void poz(long long li,long long ls,long long &k)
{
long long i=li,j=ls,c=0,i1=1,j1=0;
while (i<j)
{
if(a[i]>a[j])
{
c=a[i];
a[i]=a[j];
a[j]=c;
c=i1;
i1=-j1;
j1=-c;
}
i=i+i1;
j=j+j1;
}
k=i;
}
void quick(long long li,long long ls,long long nr)
{
if(li<ls)
{
poz(li,ls,k);
if(nr<k) quick(li,k-1,nr);
else if(nr>k) quick(k+1,ls,nr);
}
}
int main()
{
long long i;
ifstream f("sdo.in");
ofstream g("sdo.out");
f>>n>>nr;
for(i=1;i<=n;i++)
f>>a[i];
quick(1,n,nr);
g<<a[nr];
}