# Forest Fire – Techgig, All testcases passed. Challenge #1

### Forest FireĀ (100 Marks)

Challenge 1: Forest fire

You are camping in a forest area at night. You are living with the forest officers to experience their challenges and hardships to create a documentary on them. Everything was going well. Suddenly, a fire has broken out in the forest and it is expanding exponentially. There is a lot of chaos and cries of animals. It is going to take alot of time for the backup. Some of the posts in the forest have also caught fire. The officers are trying everything to safeguard the animals but the fire is spreading too fast. Amid such chaos, the petrol tankers of the officers have also caught fire. The fire is unstoppable now and the commanding officer is taking important decisions with his officers.

The officers know the energy levels of all the N animals in the forest at the moment. It is a tough decision for them as they can only save exactly X animals because of the current situation of the transports they have. Since, the animals are pride of the forest, the energy level of the animals are represented with P. All the animals with energy level equal to P or greater than P can board the available transports and they will be moved to a safer place. But since the capacity is for exactly X animals it is going to be tough to figure out.

Officer needs your help to figure out the minimum energy level P such that they can get exactly X animals to transport. If it is not possible to save exactly X animals, then you should respond with -1 so that they can think of some other plan. The officers are busy trying to get control of the fire and are counting on you to figure out the minimum P to save and transport exactly X animals.

Forest Fire Example:

Number of animals, N = 5

Energy level of N animals = { 1, 3, 2, 4, 5 }

Current available capacity, X = 4

You should choose P = 2, so that exactly 4 animals with energy levels (2, 3, 4 and 5) can be saved as these have energies greater than or equal to P.

##### Input Format

The first line of input consists of two space-separated integers, N (number of animals) and X (available capacity for animals that can be transported).

The second line of input consists of N space-separated integers, representing the energy of all the animals.

##### Constraints

1<= N <=10^5

1<= X <=N

1<= arr[i] <=10^12

Arr[i] represents the energy level of the ith animal.

##### Output Format

Print the minimum energy level P such that exactly X animals can be saved or transported. If it is not possible to save exactly X animals, then print -1.

###### Sample TestCase 1
``````Input
5 4
1 3 2 4 5``````
``````Output
2``````

``````<?php
\$fp = fopen('php://stdin', 'r');
\$l = 0;
while( \$line = fgets( \$fp ) ) {
\$lines[\$l] = \$line;
\$l++;
}
fclose( \$fp );

\$ex_line1 = explode(' ', \$lines[0]);
\$n = \$ex_line1[0];
\$x = \$ex_line1[1];

\$animals =explode(' ', \$lines[1]);
rsort(\$animals);
\$count = 0;

for(\$i=0; \$i<=\$n; \$i++)
{
if(\$animals[\$i] >= \$animals[\$x-1])
{
\$count++;
}
else
{
break;
}
}

if(\$count==\$x)
{
echo \$animals[\$x-1];
}
else{
echo -1;
}``````

This is the PHP version solution for Forest Fire with all testcases passed. You can code in any language for this Forest fire.

Here is the link to Forest Fire.

Here is the solution for second test The Magic Wand.