{ 二分答案 }soj2015

2015. A New Year Gift

Description

 Windbreaker was planning to send his friends some necklaces as New Year gifts. To show sincerity ，he decided to make the necklaces all by himself. He bought some kinds of pearls and each kind of pearls has a different color from others. He wanted to make each necklace consisted of M pearls from different kinds, that’s what he called M-perfect necklace. Windbreaker wanted to know the maximum number of necklaces he could send out to his friends. The number of pearls of each kind and M are given, and now you are asked to tell Windbreaker how many M-perfect necklaces he could make at most

Input

 You will be given a number of cases in the input. Each case starts with a positive integer n(n<=1000),which is the number of different kinds;

The second line contains n positive numbers represent for the number of pearls of each kind which will not exceed 2000.

The third line contains a positive number M(1<=M<=100).

The end of input is indicated by a line containing n=0.

 

Output

 For each test case, output a line containing the Maximum number of M-perfect necklaces.

Sample Input

 Copy sample input to clipboard

5
3 3 3 3 3
5
6
1 2 3 4 5 6
5
0

Sample Output

3
3

我是要WA多几题才有二分答案的概念。。。。。。。

不是dp能证明贪心都给我去二分啊啊啊啊