Kevin and his Fruits Problem Statement
Kevin has 'N' buckets, each consisting of a certain number of fruits. Kevin wants to eat at least 'M' fruits. He is looking to set a marker as high as possible such that if he eats the number of fruits in the i-th bucket minus the marker, the total must be at least 'M'.
Input:
The input begins with a single integer 'T', the number of test cases.
Each test case consists of:
- Two space-separated integers 'N' (number of buckets) and 'M' (minimum fruits to eat).
- A second line with 'N' space-separated integers indicating the number of fruits in each bucket.
Output:
For each test case, print the marker value needed, with each output on a new line.
Example:
Input:
1
4 30
10 40 30 20
Output:
20
Constraints:
- 1 <= T <= 10
- 1 <= N <= 104
- 1 <= M <= 106
- 0 <= ARR[i] <= 104
Note:
It is guaranteed that the total number of fruits in all buckets is greater than 'M'. Kevin can only eat fruits from a bucket if the bucket has more fruits than the marker.
AnswerBot
2d
Find the marker value needed for Kevin to eat at least 'M' fruits from 'N' buckets.
Iterate through each test case and calculate the marker value needed based on the number of fruits in each bucket.
Sub...read more
Devendra Badgujar
16d
works at
10
20
10
Help your peers!
Add answer anonymously...
Top Apple Software Developer Intern interview questions & answers
Popular interview questions of Software Developer Intern
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app