Pagini recente » Cod sursa (job #656421) | Istoria paginii runda/oni2014cls10z2/clasament | Cod sursa (job #2029466) | Istoria paginii runda/concurs_cu_o_problema_usoara_si_una_medie/clasament | Cod sursa (job #742389)
Cod sursa(job #742389)
#include <fstream>
using namespace std;
const int N = 3000005;
int sir[N], n, k;
ifstream in("sdo.in");
ofstream out("sdo.out");
bool okay(int x)
{
int nr = 0;
for (int i = 1 ; nr < k && i <= n ; i++)
if (sir[i] <= x)
nr++;
return nr < k;
}
int bs()
{
int i, step = 1 << 29;
for (i = 0 ; step ; step >>= 1)
if (okay(i + step))
i += step;
return i + 1;
}
int main()
{
in >> n >> k;
for (int i = 1 ; i <= n ; i++)
in >> sir[i];
out << bs() << "\n";
return 0;
}