Queueing at Bank (25)

输入描述:

Each input file contains one test case.  For each case, the first line contains 2 numbers: N (<=10000) - the total number of customers, and K (<=100) - the number of windows.  Then N lines follow, each contains 2 times: HH:MM:SS - the arriving time, and P - the processing time in minutes of a customer.  Here HH is in the range [00, 23], MM and SS are both in [00, 59].  It is assumed that no two customers arrives at the same time.
Notice that the bank opens from 08:00 to 17:00.  Anyone arrives early will have to wait in line till 08:00, and anyone comes too late (at or after 17:00:01) will not be served nor counted into the average.

输出描述:

For each test case, print in one line the average waiting time of all the customers, in minutes and accurate up to 1 decimal place.

7 3<br/>07:55:00 16<br/>17:00:01 2<br/>07:59:59 15<br/>08:01:00 60<br/>08:00:00 30<br/>08:00:02 2<br/>08:03:00 10

8.2