Cod sursa(job #856306)
Utilizator | Data | 16 ianuarie 2013 11:09:51 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cstdio>
#include <algorithm>
const int maxn = 3000005;
using namespace std;
int A[maxn], n, k;
int main() {
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
scanf("%d %d\n", &n, &k);
for( int i = 1; i <= n; ++i)
scanf("%d", &A[i]);
random_shuffle(A + 1, A + n + 1);
nth_element(A + 1, A + k, A + n + 1);
printf("%d\n", A[k]);
return 0;
}