Cod sursa(job #2263040)
| Utilizator | Data | 18 octombrie 2018 01:24:03 | |
|---|---|---|---|
| Problema | Statistici de ordine | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
#define MaxN 3000005
std::ifstream InFile("sdo.in");
std::ofstream OutFile("sdo.out");
int Bulaneala[MaxN];
int N, K;
void Citire() {
InFile >> N >> K;
}
void Rezolvare() {
for (int i=0; i<N; ++i)
InFile >> Bulaneala[i];
std::nth_element(Bulaneala, Bulaneala+K-1, Bulaneala+N);
OutFile << Bulaneala[K-1];
}
int main()
{
Citire();
Rezolvare();
return 0;
}
