A1017 Queueing at Bank (25 分)

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
using namespace std;
const int inf = (1 << 31) - 10;
const int maxn = 10010;
struct Node{
	int arr, p;
}node[maxn];
int win[110]; 
int N, W, num;
int L = 8 * 3600, R = 17 * 3600;
bool cmp(Node n1, Node n2){
	return n1.arr < n2.arr;
}
int main(){	
	scanf("%d %d", &N, &W);
	int hh, mm, ss, t, p;
	for(int i = 0; i < N; i++){
		scanf("%d:%d:%d %d", &hh, &mm, &ss, &p);
		t = hh * 3600 + mm * 60 + ss;
		if(t <= R){
			node[num].arr = t;
			node[num++].p = min(p * 60, 3600);
		}	
	}
	if(num == 0){
		printf("0.0\n"); return 0;
	}
	sort(node, node + num, cmp);
	for(int i = 0; i < W; i++){
		win[i] = L;
	}
	int wait = 0;
	for(int i = 0; i < num; i++){
		int idx = 0, mint = inf;
		for(int j = 0; j < W; j++){
			if(win[j] <= mint){
				mint = win[j];
				idx = j;
			}
		}
		if(node[i].arr < win[idx]){
			wait += win[idx] - node[i].arr;
			win[idx] += node[i].p; 		
		}else{
			win[idx] = node[i].arr + node[i].p;
		}		
	}			
	printf("%.1f\n", (double)wait / (60 * num));
	return 0;
}