Burici
You are given n buckets. Each bucket has some amount of water. You can make exactly m holes at the bottom of the buckets (m >= n). Through each hole, 1 liter of water will leak per second.
You can make all the m holes at the exact same moment. You have to find out what is the minimal time T before all the water leaks out from all the buckets.
InputFrom the first line of the standard input read two integer n and m, the number of buckets (n <= 50000), and the number of holes you can make (m <= 400000). The next line will contain n integers, representing the amount of water (in liters) in each of the n buckets. Each bucket will have <= 2000000000 liters of water
OutputTo the standard output, write the minimal amount of time needed for all the water to leak out. The time should be in seconds with two decimal point precision
Input:
Output:
3 9
6 10 2Output:
2.00Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.