Cod sursa(job #2735616)
Utilizator | Data | 2 aprilie 2021 16:54:38 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 3e6 + 10;
int arr[maxn];
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", arr+i);
nth_element(arr, arr+k-1, arr+n);
printf("%d\n", arr[k-1]);
return 0;
}