Maximize the number of toys that can be purchased


To maximize the number of toys that can be purchased, write a function solve that should accept TWO parameters and return an integer value representing the maximum number of toys a man can purchase.
A toy can't be bought multiple times.

The purpose of the function is to maximize the number of toys that can be purchased.

Function should accept the following parameters:
1.) arr = an array of integers
2.) a = an integer

Example
Input:
arr = [4, 5, 6, 8]
a = 10
Output:
The function will return,
(4, 5)
(4, 6)

Explanation
A man can buy (4, 5) for (9) units of currency or he can buy (4, 6) for (10) units of currency. And hence to maximize the number of toys that can be purchased. These are the two possible sets of toys that he can purchase.

Constraints
• A price will always be greater than 1 and less than 1000.
• The number of total currency will always be greater than 1 and less than 1000.
• Total prices will always be greater than 1 and less than 10000.