Develop a python code using math module(compulsory to include) in python that solves the given problem: Donald takes part in competition in mathematics. He is an experienced and well-prepared competitor! He participated in many important contests and won some of them. Now his level is rather high. In order to keep fit, Donald decided to improve his training sessions. He downloaded N task packages. There are Ai tasks in i'th package. They are really interesting and complicated, so Donald wants to solve them all! Unfortunately, it is going to be an important contest in a few days, so Donald can solve at most X tasks before it. Let's assume, that Donald can solve any X problems before the contest. Do you know what makes Donald happy? Right! Successful packages! A package of tasks is successful, if Donald solved all the tasks in it. Do you also know what makes Donald sad? Right! Failed packages! A package of tasks is failed, if Donald solved less than a half of the tasks in it. Please, help Donald to organize his training session! Donald wants to minimize the nu
Required:
Develop a python code using math module(compulsory to include) in python that solves the given problem:
Donald takes part in competition in mathematics. He is an experienced and well-prepared competitor! He participated in many important contests and won some of them. Now his level is rather high.
In order to keep fit, Donald decided to improve his training sessions. He downloaded N task packages. There are
Unfortunately, it is going to be an important contest in a few days, so Donald can solve at most X tasks before it. Let's assume, that Donald can solve any X problems before the contest.
Do you know what makes Donald happy? Right! Successful packages! A package of tasks is successful, if Donald solved all the tasks in it.
Do you also know what makes Donald sad? Right! Failed packages! A package of tasks is failed, if Donald solved less than a half of the tasks in it.
Please, help Donald to organize his training session!
Donald wants to minimize the number of failed packages. If there are several ways of doing this, he wants to maximize the number of successful packages. Remember also that he can't solve more than X tasks before the contest.
Input
The first line contains two integers P and Q. The second line contain P positive integers, i'th integer denotes Ai. The array A is 1-indexed
Output
Output must contain two space separated integers having the number of failed packages and the number of successful packages in the optimal way of solving.
Example Input:
3 17
2 4 5
Example Output:
0 3
Step by step
Solved in 2 steps with 1 images
