1017 Queueing at Bank (25分)

题目链接

思路

先按到达时间排序，并移除迟到的，然后依次计算等待时间。
本题需要以秒计算，以分钟输出

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef struct custom
{
	int atmm;
	int needmm;
};

int n, k;

bool cmp(custom c1, custom c2)
{
	if (c1.atmm == c2.atmm)
		return c1.needmm < c2.needmm;
	else
		return c1.atmm < c2.atmm;
}

int find_mini_window(vector<int> &window)
{
	int min = 99999, index = 0;
	for (int i = 0; i < k; i++)
	{
		if (window[i] < min)
		{
			index = i;
			min = window[i];
		}
	}
	return index;
}

void decrease_time(vector<int>& window,int t)
{
	for (int i = 0; i < k; i++)
	{
		if (window[i] <= t)
			window[i] = 0;
		else
			window[i] -= t;
	}
}

int main() {
	vector<custom> customs(0);
	cin >> n >> k;
	int hh, mm, ss, need;
	custom cc;
	double totalwait = 0.0;
	for (int i = 0; i < n; i++)
	{
		scanf("%d:%d:%d %d", &hh, &mm, &ss,&need);
		if (hh >= 17 && (mm > 0 || ss > 0))
			continue;
		else if (hh < 8)
		{
			totalwait += ((8 - hh) * 60 - mm) * 60 - ss;
			cc.atmm = 0;
			cc.needmm = need * 60;
			customs.push_back(cc);
		}
		else
		{
			cc.atmm = ((hh - 8) * 60 + mm) * 60 + ss;
			cc.needmm = need * 60;
			customs.push_back(cc);
		}
	}
	
	sort(customs.begin(),customs.end(),cmp);
	int nowtime = 0,wind = 0,durtime = 0;
	vector<int> window(k);
	for (auto it = customs.begin(); it != customs.end(); it++)
	{
		durtime = it->atmm - nowtime;
		decrease_time(window, durtime);
		nowtime = it->atmm;
		wind = find_mini_window(window);
		totalwait += window[wind];
		window[wind] += it->needmm;
	}
	printf("%.1f", totalwait / 60.0 / customs.size());

	return 0;
}