#include <bits/stdc++.h>
using namespace std;
int MAX=10005;
struct Person{
int come,time;
};
bool cmp(Person a,Person b)
{
return a.come<b.come;
}
int main()
{
int m,n,cnt=0,total=0;
cin >> m >> n;
struct Person p[MAX];
for(int i=0;i<m;i++)
{
int h,mm,s,t;
scanf("%d:%d:%d %d",&h,&mm,&s,&t);
int sum = h*3600+mm*60+s;
if(sum >= 61200) continue;
p[cnt].come = sum;
p[cnt++].time= t*60;
}
sort(p,p+cnt,cmp);
priority_queue<int,vector<int>,greater<int>> q;
for(int i=0;i<n;i++) q.push(28800);
for(int i=0;i<cnt;i++)
{
if(p[i].come>=q.top())
{
q.push(p[i].come+p[i].time);
q.pop();
}else{
total += q.top()-p[i].come;
q.push(q.top()+p[i].time);
q.pop();
}
}
(!cnt) ? printf("0.0\n") : printf("%.1lf", ((double)total/60.0)/(double) cnt);
return 0;
}
PAT甲级1017:Queuing At Bank
最新推荐文章于 2021-01-29 22:26:30 发布