PAT甲级 1017 Queueing at Bank (25分)

 

1. 先按到达时间进行从小到大排序
2. 每次暴力选出一个最合适的窗口,并将这个窗口的下次服务时间进行对应修改
3. 在选窗口时,如果窗口的下次服务时间早于到达时间,则无需等待,如果下次服务时间晚于到达时间,则等待时间位两者的时间差。

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

vector<pair<int,int>> vect;

int main(){
    int n, k, time, h, m, s;
    char c;
    cin >> n >> k;
    for (int i = 0; i < n; ++i){
        cin >> h >> c >> m >> c >> s >> time;
        vect.push_back({h * 3600 + m * 60 + s, time * 60});
    }
    
    sort(vect.begin(), vect.end());
    
    double wait = 0, cnt = 0;
    
    vector<int> stime(k, 3600 * 8);  // 各个窗口的下次服务时间
    
    for (int i = 0; i < n; ++i){
        int diff = 0x3f3f3f3f;
        int id;
        if (vect[i].first >= 17 * 3600 + 1) break;   // 下班了
        for (int j = 0; j < k; ++j){ 
            if((stime[j] > vect[i].first) && (diff > (stime[j] - vect[i].first))){
                diff = (stime[j] - vect[i].first);
                id = j;
            }else if((stime[j] <= vect[i].first)){
                diff = 0;
                id = j;
                break;
            }
        }
        stime[id] = max(stime[id], vect[i].first) + vect[i].second;
        wait += diff;
        cnt ++;
    }
    wait = (wait * 1.0) / 60;
    printf("%.1f\n",wait/cnt);
    // cout<<(wait * 1.0) / cnt;
    return 0;
}