Pagini recente » Cod sursa (job #229661) | Cod sursa (job #2577924) | Cod sursa (job #1831174) | Cod sursa (job #1463306) | Cod sursa (job #1648368)
#include <fstream>
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
FILE *in, *out;
in = fopen ("sdo.in", "rt");
out = fopen ("sdo.out", "wt");
int n, k, i, v[300000001];
void read()
{
fscanf(in, "%d%d", &n, &k);
for(i = 1; i <= n; i ++)
fscanf(in, "%d", &v[i]);
}
void solve()
{
nth_element(v+ 1, v + k, v + n + 1);
}
void write()
{
fprintf(out, "%d", v[k]);
}
int main()
{
read();
solve();
write();
fclose(in);
fclose(out);
return 0;
}