Cod sursa(job #2342656)
| Utilizator | Data | 12 februarie 2019 23:54:33 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("sdo.in");
ofstream fout("sdo.out");
const int NMax = 3e6;
int N, K, V[NMax + 5];
int main()
{
fin >> N >> K;
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;
}
