BALLOT  Distributing Ballot Boxes
Today, besides SWERC’11, another important event is taking place in Spain which rivals it in importance: General Elections. Every single resident of the country aged 18 or over is asked to vote in order to choose representatives for the Congress of Deputies and the Senate. You do not need to worry that all judges will suddenly run away from their supervising duties, as voting is not compulsory.
The administration has a number of ballot boxes, those used in past elections. Unfortunately, the person in charge of the distribution of boxes among cities was dismissed a few months ago due to financial restraints. As a consequence, the assignment of boxes to cities and the lists of people that must vote in each of them is arguably not the best. Your task is to show how efficiently this task could have been done.
The only rule in the assignment of ballot boxes to cities is that every city must be assigned at least one box. Each person must vote in the box to which he/she has been previously assigned. Your goal is to obtain a distribution which minimizes the maximum number of people assigned to vote in one box.
In the first case of the sample input, two boxes go to the first city and the rest to the second, and exactly 100,000 people are assigned to vote in each of the (huge!) boxes in the most efficient distribution. In the second case, 1, 2, 2 and 1 ballot boxes are assigned to the cities and 1,700 people from the third city will be called to vote in each of the two boxes of their village, making these boxes the most crowded of all in the optimal assignment.
Input
The first line of each test case contains the integers N (1 ≤ N ≤ 500,000), the number of cities, and B (N ≤ B ≤ 2,000,000), the number of ballot boxes. Each of the following N lines contains an integer a_{i}, (1 ≤ a_{i} ≤ 5,000,000), indicating the population of the i^{th} city.
A single blank line will be included after each case. The last line of the input will contain 1 1 and should not be processed.
Output
For each case, your program should output a single integer, the maximum number of people assigned to one box in the most efficient assignment.
Sample Input
2 7 200000 500000 4 6 120 2680 3400 200 1 1
Sample Output
100000 1700
Problemsetter: Luis Hernandez Corbato
hide comments
trucoder:
20190804 07:12:23
priority queue is best 

sampreyo:
20190115 11:25:01
binary search or priority queue both work


kushagrasri:
20190107 15:14:58
AC in one go! Classic Binary Search :)


Rahul Raturi:
20180819 04:57:50
O(nlog(max(a))) tle in python :/ Last edit: 20180819 07:25:52 

sherlocklives:
20180702 15:54:26
O(BlogN) passes 

anirudnits:
20180618 21:32:05
don't trust spoj toolkit for this one. 

code_aim:
20170528 19:55:21
Similar to AGGRCOW.


vengatesh15:
20170205 13:42:33
Binary search :) 

ahmed Ibrahim:
20160827 17:17:37
AC in first attempt , in first i solved problem (http://www.spoj.com/problems/AGGRCOW/)


SHIVEK SACKLECHA:
20151229 22:31:53
Accepted in first attempt :D

Added by:  David GarcĂa Soriano 
Date:  20111126 
Time limit:  7.451s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Southwestern Europe Regional, SWERC 2011 