MAIN8_C  Shake Shake Shaky
Shaky has N (1<=N<=50000) candy boxes each of them contains a nonzero number of candies (between 1 and 1000000000). Shakey want to distibute these candies among his K (1<=K<=1000000000) IIITDelhi students. He want to distibute them in a way such that:
1. All students get equal number of candies.
2. All the candies which a student get must be from a single box only.
As he want to make all of them happy so he want to give as many candies as possible. Help Shaky in finding out what is the maximum number of candies which a student can get.
Input
First line contains 1<=T<=20 the number of test cases. Then T test cases follow. First line of each test case contains N and K. Next line contains N integers, ith of which is the number of candies in ith box.
Output
For each test case print the required answer in a seperate line.
Example
Input: 2 3 2 3 1 4 4 1 3 2 3 9 Output: 3 9
hide comments
beowulf_rohan:
20200829 23:37:07
try mid = start + (endstart+1)/2


shantanu404:
20200428 21:01:23
This problem can be solved without using 'long long', you want use 'low + (high  low)/2' for calculating 'mid'. That would avoid any kind of overflow and this is how you should always do this. Last edit: 20200428 21:03:32 

tushar260900:
20191226 07:43:23
submitting using binary search and long long also


mayanku1999:
20190903 13:26:26
Binary Search application based ques, just like Aggressive cows


maratha:
20190811 12:30:58
BS FTW!! 

divergent42:
20190705 09:41:37
Good question 

exesharkx:
20190410 15:37:51
print 0 if not possible


sajalagrawal14:
20190128 13:46:01
ac in one go 

anubhawiiitu:
20180102 15:52:46
TLE with int


themast3r:
20171104 23:49:02
AC in 2nd go due to stupid problem description. Make sure to:

Added by:  Mahesh Chandra Sharma 
Date:  20110420 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own problem used for NSITIIITA Main contest #8 