PAT 1017 Queueing at Bank—优先队列模拟

最新推荐文章于 2020-10-04 00:55:18 发布

adventural

最新推荐文章于 2020-10-04 00:55:18 发布

阅读量158

点赞数

分类专栏： PAT 文章标签： PAT 优先队列

本文链接：https://blog.csdn.net/adventural/article/details/86768726

版权

PAT 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

题解

原题链接
用两个优先队列，一个存储顾客到达时间，另一个存储窗口空闲时间点

#include <iostream>
#include <queue>
#include <cstdio>
#define MIN 8*60*60
#define MAX 17*60*60
#define tosec(a,b,c) a*60*60+b*60+c

using namespace std;

typedef pair<int, int> P;

struct cmp
{
    bool operator()(const P p1, const P p2)
    {
        return p1.first > p2.first;
    }
};

int main()
{
    priority_queue<P, vector<P>, cmp> cust;
    priority_queue<int, vector<int>, greater<int> > window;
    int N, K, hh, mm, ss, servt, len;
    double waitsum=0;
    scanf("%d %d",&N, &K);
    for (int i=0; i<N; i++)
    {
        scanf("%d:%d:%d %d",&hh, &mm, &ss, &servt);
        servt *= 60;
        if (servt > 3600)
            servt = 3600;
        if (tosec(hh,mm,ss)<=MAX)
        {
            P p1(tosec(hh,mm,ss),servt);
            cust.push(p1);
        }
    }
    len = cust.size();
    if (len <= K)
    {
        while(!cust.empty())
        {
            P p1=cust.top();
            cust.pop();
            if (p1.first < MIN)
                waitsum += (MIN-p1.first);
        }
    }
    else
    {
        for (int i=0; i<K; i++)
        {
            P p1=cust.top();
            if (p1.first >= MIN)
                window.push(p1.first+p1.second);
            else
            {
                waitsum += (MIN-p1.first);
                window.push(MIN+p1.second);
                printf("%.1f\n",waitsum/60);
            }
            cust.pop();
        }
        for (int i=K; i<len; i++)
        {
            int current=window.top();
            window.pop();
            P p1=cust.top();
            cust.pop();
            if (p1.first >= current)
                window.push(p1.first+p1.second);
            else
            {
                waitsum += (current-p1.first);
                window.push(current+p1.second);
                printf("%.1f\n",waitsum/60);
            }
        }
    }
    if (waitsum == 0)
        printf("0.0");
    else
    {
        waitsum /= len;
        printf("%.1f",waitsum/60);
    }
    return 0;
}