Pagini recente » Cod sursa (job #646295) | Cod sursa (job #2395194) | Cod sursa (job #1498820) | Cod sursa (job #1977420) | Cod sursa (job #2378065)
#include <fstream>
using namespace std;
const int DIM = 3000001;
ifstream cin("sdo.in");
ofstream cout("sdo.out");
int sir[DIM];
int partitie(int, int);
void qs(int, int, int);
int n, k;
int main()
{
cin >> n >> k;
for(int i = 1; i <= n; ++i)
{
cin >> sir[i];
}
qs(1, n, k);
cout << sir[k];
return 0;
}
void qs(int st, int dr, int k)
{
if(st >= dr)
{
return;
}
int m = partitie(st, dr);
if(k < m)
{
qs(st, m - 1, k);
}
if(k > m)
{
qs(m + 1, dr, k);
}
}
int partitie(int st, int dr)
{
int m = st;
for(int i = st; i < dr; ++i)
{
if(sir[i] < sir[dr])
swap(sir[i], sir[m++]);
}
swap(sir[m], sir[dr]);
return m;
}