Problem of the day
if Ayush want to study 6 chapters in 3 days and the time that each chapter requires is as follows:
Chapter 1 = 30
Chapter 2 = 20
Chapter 3 = 10
Chapter 4 = 40
Chapter 5 = 5
Chapter 6 = 45
Then he will study the chapters in the following order
| day 1 : 1 , 2 | day 2 : 3 , 4 | day 3 : 5 , 6 |
Here we can see that he study chapters in sequential order and the maximum time to study on a day is 50, which is the minimum possible in this case.
The first line of the input contains a single positive integer 'T', denoting the number of test cases.
The first line of each test case contains two space-separated positive integers 'N' and 'M', denoting the number of days he can study before the ninja test and the number of chapters he has to study for the ninja test respectively.
The second line of each test case contains 'M' space-separated positive integers, where the ith integer denotes the time required to study the ith chapter.
For each test case print a single line containing a single integer denoting the maximum time Ayush studies in a day.
The output of each test case will be printed in a separate line.
You don't have to print anything, it has already been taken care of. Just Implement the given function.
1 <= T <= 10
1 <= N , M <= 10 ^ 4
1 <= TIME[i] <= 10 ^ 9
It is considered that there are infinite seconds in a day, on the planet where Ayush lives.
Time limit: 1 sec.
1
3 5
1 2 2 3 1
4
The ayush will read the chapter as follows,
Day 1 : 1 , 2 Time required : 3
Day 2 : 3 Time required : 2
Day 3 : 4 , 5 Time required : 4
So the maximum time in a day is 4.
1
4 7
2 2 3 3 4 4 1
6
The ayush will read the chapter as follows,
Day 1 : 1 , 2 Time required : 4
Day 2 : 3 , 4 Time required : 6
Day 3 : 5 Time required : 4
Day 4 : 6 , 7 Time required : 5
So the maximum time in a day is 6.