PAT 1014. Waiting in Line (30)

//AC
//看了别人的代码，发现也并不是很复杂
//关键是要在入队时就把每个人的离开时间计算出来，这样方便多了
#include<iostream>
#include<queue>
#include<cstdio>
#define customer_max 1000+5

using namespace std;

queue<int> que[20 + 5];
int leavetime[customer_max] = { 0 };
int processtime[customer_max] = { 0 };
int cleartime[20 + 5] = { 0 };
int n, m, k, q;
int i = 0, j = 0;

int main(){
	cin >> n >> m >> k >> q;
	while (++i <= k)
		cin >> processtime[i];
	i = 1;
	int top = 1;
	for (; top <= k&&top <= m*n; top++){
		if (!i)	i += n;//窗口序号调整一下，从1-n
		que[i].push(top);
		leavetime[top] = cleartime[i] + processtime[top];
		cleartime[i] = leavetime[top];
		i = (i + 1) % n;
	}
	for (; top <= k; top++){
		//每一个客户要找队首客户leavetime最小的队列入队
		int min_time = leavetime[que[1].front()];
		int index = 1;
		for (i = 1; i <= n; i++){
			int first = que[i].front();
			if (min_time > leavetime[first]){
				min_time = leavetime[first];
				index = i;
			}
		}
		que[index].pop();
		que[index].push(top);
		leavetime[top] = cleartime[index] + processtime[top];
		cleartime[index] = leavetime[top];
	}
	while (q--){
		int tmp; cin >> tmp;
		if (leavetime[tmp] - processtime[tmp] >= 9 * 60)//注意等号，恰好在17：00轮到的客户是不能办理的
			printf("Sorry\n");
		else
			printf("%02d:%02d\n", leavetime[tmp] / 60 + 8, leavetime[tmp] % 60);
	}
}