Pagini recente » Cod sursa (job #1417091) | Cod sursa (job #2059118) | Cod sursa (job #1998811) | Cod sursa (job #2433103) | Cod sursa (job #1060507)
#include <iostream>
#include<fstream>
using namespace std;
long x[30000001],n;
ifstream f("sdo.in");
ofstream g("sdo.out");
void schimb(long &a,long &b)
{
long aux=a;
a=b;
b=aux;
}
void divizeaza(long s,long d,long &m)
{
long i=s,j=d,pi=0,pj=1;
while(i<j)
{
if(x[i]>x[j])
{
schimb(x[i],x[j]);
schimb(pi,pj);
}
i=i+pi;
j=j-pj;
}
m=i;
}
void quicksort(long s,long d)
{
long m;
if(s<d)
{
divizeaza(s,d,m);
quicksort(s,m-1);
quicksort(m+1,d);
}
}
int main()
{
long i,k;
f>>n>>k;
for(i=1;i<=n;i++)
f>>x[i];
quicksort(1,n);
g<<x[k];
return 0;
}