Cod sursa(job #2698389)
Utilizator | Data | 21 ianuarie 2021 21:26:50 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <algorithm>
using namespace std;
const int NMAX = 3000000;
int v[NMAX];
int main()
{
ifstream in("sdo.in");
ofstream out("sdo.out");
int n, k;
in >> n >> k;
for (int i = 0; i < n; i++)
{
in >> v[i];
}
nth_element(v, v + k - 1, v + n);
out << v[k - 1] << '\n';
return 0;
}