Pagini recente » Cod sursa (job #1213594) | Cod sursa (job #969220) | Cod sursa (job #2665507) | Cod sursa (job #559268) | Cod sursa (job #1060509)
#include <iostream>
#include<fstream>
using namespace std;
long v[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 pivot=v[s];
while(s<d)
{
while(v[s]<pivot)
s++;
while(v[d]>pivot)
d--;
if(s<d)
schimb(v[s],v[d]);
}
m=d;
}
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>>v[i];
quicksort(1,n);
g<<v[k];
return 0;
}