Cod sursa(job #821311)
Utilizator | Data | 22 noiembrie 2012 04:38:11 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int A[3000000];
int main() {
freopen("sdo.in", "r", stdin);
freopen("sdo.out", "w", stdout);
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", A + i);
}
nth_element(A, A + k - 1, A + n);
printf("%d", A[k - 1]);
return 0;
}