Cod sursa(job #2603308)
Utilizator | Mihai Cosmin bmc213 | Data | 19 aprilie 2020 10:34:52 |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int v[3000005], n, i, 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];
return 0;
}