Cod sursa(job #2650462)
Utilizator | Data | 18 septembrie 2020 21:34:17 | |
---|---|---|---|
Problema | Statistici de ordine | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
ifstream fin ("sdo.in");
ofstream fout ("sdo.out");
int n, k;
fin >> n >> k;
for (int i = 0; i < n; ++i) {
fin >> v[i];
}
nth_element(v, v + k - 1, v + n);
fout << v[k - 1];
return 0;
}