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