【PAT】PAT A1017 Queueing at Bank【快乐模拟】

Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wait in line behind the yellow line, until it is his/her turn to be served and there is a window available. It is assumed that no window can be occupied by a single customer for more than 1 hour.

Now given the arriving time T and the processing time P of each customer, you are supposed to tell the average waiting time of all the customers.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 numbers: N (≤10​4​​) - 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.

Output Specification:

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.

Sample Input:

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

Sample Output:

8.2

题目大意

题目给定某银行的窗口数和顾客的到来时间以及服务所需时间，题目要求给出所有顾客的平均等待时间。每窗口服务一名顾客，共用队列，迟到者不被计数。

思路

• 对于读取数据，将客户的到达时间转换为相对于营业时间（8点整）的时间偏移量（单位：秒），对于超过关门时间（17点的）的客户直接忽略。然后对客户根据到达时间从早到晚排序。
• 首先使各个窗口服务第一位客户，对于到达时间早于营业时间的，按营业时间到达计。
• 由于使用优先队列存放窗口对象，可以很方便的，使用while循环，每出来一位客户就从队列里再进去一位，这里分两种情况：
  • 客户到达时刻晚于窗口空闲时刻：客户在达到时刻被服务，等待时间为0。
  • 客户到达时刻早于窗口空闲时刻：客户在窗口空闲时被服务，等待时间为窗口空闲时刻-客户到达时刻。

代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
#define maxK 100
#define maxN 10000
struct Customer{
   
    int arrive;
    int