Cod sursa(job #2517558)
Utilizator | Data | 3 ianuarie 2020 18:46:25 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
#define NMAX 3000005
using namespace std;
ifstream f("sdo.in");
ofstream g("sdo.out");
int v[NMAX], n, k;
int main()
{
f >> n >> k;
for (int i = 1; i <= n; i++)
{
f >> v[i];
}
nth_element(v + 1, v + k, v + n + 1);
g << v[k];
return 0;
}