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