Cod sursa(job #2673769)
Utilizator | Data | 17 noiembrie 2020 17:56:09 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
#include <algorithm>
const int nmax = 3e6 + 5;
int v[nmax];
int main() {
std::ifstream fin("sdo.in");
std::ofstream fout("sdo.out");
int n, k;
fin >> n >> k;
for (int i = 1; i <= n; i++) fin >> v[i];
std::nth_element(v + 1, v + k, v + n + 1);
fout << v[k];
}