1017 Queueing at Bank (25分)（一个字短！）

1017 Queueing at Bank (25分)

分析

在输入记录时，将五点之后到达的筛除
利用priority_queue的特性，每次挑选出结束时间最早的窗口，记录等待时间，出队，并添加新的结束时间

代码

#include<iostream>
#include<queue>
#include<vector>
using namespace std;
int n, m, hh, mm, ss, serving_time, cnt = 0, wait_time = 0;
struct cmp {
 bool operator()(pair<int, int>a, pair<int, int>b)const {
  return a.first > b.first;
 }
};
priority_queue<int, vector<int>, greater<int> >q;
priority_queue<pair<int, int>, vector<pair<int, int> >, cmp > qq;
int main() {
 scanf("%d %d", &n, &m);
 for (int i = 0; i < n; ++i) {
  scanf("%d:%d:%d %d", &hh, &mm, &ss, &serving_time);
  if (hh * 3600 + mm * 60 + ss > 17 * 3600)continue;
  ++cnt;
  serving_time = serving_time < 60 ? serving_time : 60;
  qq.push(pair<int, int>(hh * 3600 + mm * 60 + ss, serving_time * 60));
 }
 for (int i = 0; i < m; ++i)q.push(8 * 3600);
 while (!qq.empty()) {
  if (qq.top().first >= q.top())
   q.push(qq.top().first + qq.top().second);
  else {
   wait_time += q.top() - qq.top().first;
   q.push(q.top() + qq.top().second);
  }
  q.pop();
  qq.pop();
 }
 if (cnt == 0)printf("0.0");
 else printf("%.1lf", double(wait_time) / 60 / cnt);
 return 0;
}