PAT A 1017 Queueing at Bank (25 分)

一、题目概述&样例

略

Sample Input:

7 3
07:55:00 16
17:00:01 2
07:59:59 15
08:01:00 60
08:00:00 30
08:00:02 2
08:03:00 10

Sample Output:

8.2

二、思路

迟到的客户记录不予存储；排序并依次处理处理

三、代码

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
typedef struct
{
    int a_time, p_time;
}record;
int main()
{
    int N, K, cnt = 0, sum = 0;
    scanf("%d %d", &N, &K);
    vector<int> time( K, 8 * 60 * 60 );
    vector<record> rec;
    for( int i = 0, h, m, s, p; i < N; ++i )
    {
        scanf("%d:%d:%d %d", &h, &m, &s, &p);
        if( h * 3600 + m * 60 + s <= 17 * 3600 )
            rec.push_back( { h * 3600 + m * 60 + s, p * 60 } );
    }
    sort( rec.begin(), rec.end(), [] ( record a, record b ) { return a.a_time < b.a_time; } );
    for( int i = 0, min; i < rec.size(); ++i )
    {
        min = 0;
        for( int j = 0; j < K; ++j )
            if( time[j] < time[min] )
                min = j;
        if( time[min] > rec[i].a_time )
        {
            sum += time[min] - rec[i].a_time;
            time[min] += rec[i].p_time;
        }
        else time[min] = rec[i].p_time + rec[i].a_time;
    }
    printf("%.1f", sum / 60.0 / rec.size() );
}