Problems
Wires
Wires
Given n segments of wire of length l1
, l2
, ..., ln
centimeters. You must cut them to get k equal segments of as much length as possible, that is expressed with integer value in centimeters. If you can not get even k segments of length 1 cm, output 0.
Input
First row contains numbers n (1 ≤ n ≤ 10000) and k (1 ≤ k ≤ 10000). Next n lines contain integers l1
, l2
, ..., ln
(100 ≤ Li
≤ 107
), one number per line.
Output
Output one number - get the length of the segments.
Input example #1
4 11 802 743 457 539
Output example #1
200