Pagini recente » Cod sursa (job #946869) | Cod sursa (job #1722005) | Cod sursa (job #3150773) | Cod sursa (job #1168958) | Cod sursa (job #2064543)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int s[3000001];
void qs(int st, int dr) {
int x, i, j, t;
i = st;
j = dr;
x = s[(i + j) / 2];
do {
while ( (i < dr) && (s[i] < x) ) i++;
while ( (j > st) &&(s[j] > x) ) j--;
if ( i<= j ) {
t = s[i];
s[i] = s[j];
s[j] = t;
i++;
j--;
}
} while ( i <= j );
if ( st < j ) qs(st, j);
if ( i < dr ) qs(i, dr);
}
int main()
{
int N, k;
f >> N >> k;
for (int i = 1; i <= N; i++)
f >> s[i];
qs(1, N);
g << s[k];
return 0;
}