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.
Customer​i ​​will take T​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 customers 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, customer​1 ​​is served at window​1 ​​while customer​2 ​​is served at window​2​​. Customer​3 ​​will wait in front of window​1 ​​and customer​4 ​​will wait in front of window​2​​. Customer​5 ​​will wait behind the yellow line. At 08:01, customer​1 ​​is done and customer5 ​​enters the line in front of window1 ​​since that line seems shorter now. Customer​2 ​​will leave at 08:02, customer​4 ​​at 08:06, customer​3 ​​at 08:07, and finally customer​5 ​​at 08:10.

Input Specification:

Each input file contains one test case. Each case starts with a line containing 4 positive integers: N (≤20, number of windows), M (≤10, the maximum capacity of each line inside the yellow line), K (≤1000, number of customers), and Q (≤1000, number of customer queries).
The next line contains K positive integers, which are the processing time of the K customers.
The last line contains Q positive integers, which represent the customers who are asking about the time they can have their transactions done. The customers are numbered from 1 to K.

Output Specification:

For each of the Q customers, print in one line the time at which his/her transaction is finished, in the format HH:MM where HH is in [08, 17] and MM is in [00, 59]. Note that since the bank is closed everyday after 17:00, for those customers who cannot be served before 17:00, you must output Sorry instead.

1、先将NM个等候区位置用前NM个顾客填满（顾客1到窗口1，顾客2到窗口2……顾客N+1到窗口1）；

2、找到所有窗口中最先离开的那一个，并从相应窗口的队列中出队；

3、下一位顾客进入等候区，选择能最快为自己提供服务的窗口（那个窗口前最后一个顾客离开时间早于其他窗口就去那个）

注意：必须通过上一个人的结束时间是否超过17：00来判断下一个人是否能得到服务，因为只要一个人的开始时间小于17：00，那么他的结束时间是可以大于17：00的，所以无法根据一个人结束时间来判断他是否可以接受服务。

#include<iostream>
#include<queue>
using namespace std;
int main() {
	int n, m, k, q, ftime[1010] = { 0 }, pt;
	cin >> n >> m >> k >> q;
	queue<int>wins[20];
	int num = n * m < k ? m * n : k, i = 0;
	for (; i < num; i++) {
		cin >> pt;
		if (i / n == 0)wins[i % n].push(pt);
		else
			wins[i % n].push(wins[i % n].back() + pt);
		ftime[i] = wins[i % n].back()-pt>=9*60?0:wins[i%n].back();
	}
	for (; i < k; i++) {
		cin >> pt;
		int pos = 0, early = 16 * 60, j = 0;
		for (int j = 0; j < n; j++) {
			if (wins[j].front() < early) {
				pos = j;
				early = wins[j].front();
			}
		}
		wins[pos].pop();
		early = 16*60;
		for (; j < n; j++) {
			if (wins[j].size() < m&&wins[j].back() < early) {
				pos = j;
				early=wins[j].back();
			}
		}
		wins[pos].push(wins[pos].back() + pt);
		ftime[i] = wins[pos].back()-pt>=9*60?0:wins[pos].back();
	}
	for (i = 0; i < q; i++) {
		int query;
		cin >> query;
		if (ftime[query - 1] == 0)cout << "Sorry" << endl;
		else
			printf("%02d:%02d\n", (ftime[query - 1] + 480)/ 60, (ftime[query - 1] + 480)% 60);
	}
	return 0;
}