Cod sursa(job #2368765)
Utilizator | Data | 5 martie 2019 17:49:57 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int a[3000005], n, k;
void Solve ()
{
int i;
fin >> n >> k;
for (i = 1; i <= n; i++)
fin >> a[i];
nth_element(a + 1, a + k, a + n + 1);
fout << a[k] << "\n";
fout.close();
}
int main()
{
Solve();
return 0;
}