Pagini recente » Cod sursa (job #2509925) | Cod sursa (job #2722400) | Cod sursa (job #458641) | Cod sursa (job #2344601) | Cod sursa (job #2203947)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int v[4000001];
int pivot(int st, int dr)
{
int i, j, di, dj, aux;
i=st; j=dr; di=0; dj=1;
while(i<j)
{
if(v[i]>v[j])
{
aux=v[i]; v[i]=v[j]; v[j]=aux;
aux=di; di=dj; dj=aux;
}
i=i+di;
j=j-dj;
}
return i;
}
void sor(int st, int dr,int k)
{
int p;
if(st<=dr)
{
p=pivot(st,dr);
if(k==p) fout<<v[p];
else if(p<k)
sor(p+1,dr,k);
else sor(st,p-1,k);
}
}
int main()
{int i,n,k;
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
sor(1,n,k);
return 0;
}