A1017 Queueing at Bank （25 分）

#include<cstdio>
#include<algorithm>
using namespace std;
int N, K;
int wintime[110];
struct person
{
	int hh, mm, ss;
	int time;
}c[10010];
bool cmp(person a, person b)
{
	if (a.hh != b.hh) return a.hh < b.hh;
	else if (a.mm != b.mm) return a.mm < b.mm;
	else return a.ss < b.ss;
}
int main()
{
	fill(wintime, wintime + 110, 28800);
	int num=0,h,m,s,t;
	int wait = 0;
	scanf("%d%d", &N, &K);
	for (int i = 0; i < N; i++)
	{
		scanf("%d:%d:%d %d", &h, &m, &s, &t);
		if (h < 15 || (h == 15 && m == 0 && s == 0))
		{
			c[num].hh = h; c[num].mm = m; c[num].ss = s; c[num].time = t;
				num++;
		}
	}
	sort(c, c + num, cmp);
	for (int i = 0; i < num; i++)
	{
		int min = 1e7,p;
		int change = c[i].hh * 3600 + c[i].mm*60 + c[i].ss ;
		if (change < 28800)
		{
			wait += 28800 - change;
			change = 28800;
		}
		for (int j = 0; j < K; j++)
		{
			if (wintime[j] < min)
			{
				min = wintime[j];
				p = j;//记录选取的窗口号
			}
		}
		int temp=0;
		if (wintime[p] > change)
		{
			wait += wintime[p] - change;
			temp = wintime[p] - change;
		}
		wintime[p] = max(change,wintime[p])+c[i].time*60;//这里的开始时间是无需等待开始时间和需要等待开始时间的最大值
	}
	printf("%.1f\n", wait / (num*60.0));
	return 0;
}