Cod sursa(job #2095147)
Utilizator | Data | 27 decembrie 2017 00:08:06 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int n, k, v[3000010];
int main()
{
ifstream fin("sdo.in");
ofstream fout("sdo.out");
fin >> n;
for (int i = 1;i <= n;++i)
fin >> v[i];
nth_element(v + 1, v + k, v + n + 1);
fout << v[k] << "\n";
fin.close();
fout.close();
return 0;
}