Cod sursa(job #2931194)
Utilizator | Data | 30 octombrie 2022 17:18:49 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
constexpr int MAX_N = 3000005;
int N, K, i, x[MAX_N];
int main() {
fin >> N >> K;
for (i = 1; i <= N; i++)
fin >> x[i];
nth_element(x + 1, x + K, x + N + 1 );
fout << x[K];
fin.close();
fout.close();
return 0;
}