Cod sursa(job #1100848)
Utilizator | Data | 7 februarie 2014 16:02:43 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <algorithm>
#include <cstdio>
using namespace std;
const int MAX_N = 3000002;
int N, K, sol;
int v[MAX_N];
int main() {
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
scanf("%d %d", &N, &K);
for(int i = 1; i <= N; ++i)
scanf("%d", &v[i]);
nth_element(v + 1, v + K + 1, v + N + 1);
sol = v[K];
printf("%d\n", sol);
return 0;
}