Cod sursa(job #3123274)
Utilizator | Bejan Darius-Ramon daristyle | Data | 22 aprilie 2023 19:19:50 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
const int N_MAX = 3e6;
int v[N_MAX];
int main() {
int n, k;
fin >> n >> k;
for(int i = 0; i < n; ++i)
fin >> v[i];
nth_element(v, v + k, v + n);
fout << v[k - 1] << '\n';
fin.close();
fout.close();
return 0;
}