Pagini recente » Cod sursa (job #39195) | Cod sursa (job #1620598) | Cod sursa (job #1099309) | Cod sursa (job #934932) | Cod sursa (job #444694)
Cod sursa(job #444694)
#include <stdio.h>
#include <fstream>
#include <algorithm>
using namespace std;
#define maxN 3000100
int N, K, v[maxN];
int main () {
int i;
ifstream fin("sdo.in");
// freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
fin >> N >> K;
// scanf("%d%d", &N, &K);
for (i = 1; i <= N; ++ i)
fin >> v[i];
// scanf("%d", &v[i]);
nth_element(v + 1, v + K, v + N + 1);
printf("%d\n", v[K]);
}