Pagini recente » Cod sursa (job #926586) | Cod sursa (job #1866188) | Cod sursa (job #917510) | Cod sursa (job #78193) | Cod sursa (job #1741361)
#include<fstream>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
int m[3000000];
void qs(int s, int d)
{
int i = s, j = d;
int mij = m[(i + j) / 2];
int aux;
while (i <= j)
{
while (m[i] < mij)
{
i++;
}
while (m[j]>mij)
{
j--;
}
if (i <= j)
{
aux = m[i];
m[i] = m[j];
m[j] = aux;
i++;
j--;
}
}
if (s < j)
{
qs(s, j);
}
if (d>i)
{
qs(i, d);
}
}
int main()
{
int n,k;
fin >> n>>k;
for (int i = 0; i < n; i++)
{
fin >> m[i];
}
qs(0, n - 1);
fout << m[k - 1];
}