应邀码：ae17b8c95ce5aac5
Recently Jack becomes much more romantic. He would like to prepare several bunches of flowers.
Each bunch of flowers must have exactly M flowers. As Jack does not want to be boring, he hopes that flowers in the same bunch are all different species. Now there are N species of flowers in the flower shop, and the number of the i-th species of flower is ai. Now Jack would like to know how many bunches of flowers he can prepare at most.
(Flowers are used to propose.)
Input
The first line contains an integer T (1≤T≤10) --- the number of test cases.
In the first line of each test case, there are two integers N, M (1≤N,M≤300000) --- the number of flowers' species and the number of flowers in a bunch.
In the second line of each test case, there are N integers -
最低0.47元/天 解锁文章
812
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
