PAT -- 甲级1014 (1014 Waiting in Line）

1014 Waiting in Line (30 分)

Suppose a bank has $N$ windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. The rules for the customers to wait in line are:

• The space inside the yellow line in front of each window is enough to contain a line with $M$ customers. Hence when all the $N$ lines are full, all the customers after (and including) the $(NM+1)$st one will have to wait in a line behind the yellow line.
• Each customer will choose the shortest line to wait in when crossing the yellow line. If there are two or more lines with the same length, the customer will always choose the window with the smallest number.
• CustomeriCustomer_iCustomer​i​​ will take TiT_iT​i​​ minutes to have his/her transaction processed.
• The first $N$ customers are assumed to be served at 8:00am.

Now given the processing time of each customer, you are supposed to tell the exact time at which a customer has his/her business done.

For example, suppose that a bank has 2 windows and each window may have 2 custmers waiting inside the yellow line. There are 5 customers waiting with transactions taking 1, 2, 6, 4 and 3 minutes, respectively. At 08:00 in the morning, customer1customer_1customer​1​​ is served at window1window_1window​1​​ while customer2customer_2customer​2​​ is served at window2window_2window​2​​. Customer3Customer_3Customer​3​​ will wait in front of window1window_1window​1​​ and customer4customer_4customer​4​​ will wait in front of window2window_2window​2​​