Cod sursa(job #3124572)
Utilizator | Data | 29 aprilie 2023 13:01:24 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n, k, a[3000005];
ifstream f("sdo.in");
ofstream g("sdo.out");
int main()
{
f >> n >> k;
for (int i = 0; i < n; ++i) {
f >> a[i];
}
nth_element(a, a + k - 1, a + n);
g << a[k - 1];
return 0;
}