1017. Queueing at Bank (25)

#define  _CRT_SECURE_NO_WARNINGS
#include<cstdio>  
#include<cstring>  
#include<cmath>  
#include<string>  
#include<vector>  
#include<map>  
#include<iostream>  
#include<queue>  
#include<algorithm>  


using namespace std;
struct Window
{
int endtime; 
Window()
{
endtime = 28800;  
}
};
struct Customer
{
int arrTime, dealTime, waitTime;
};
int FindMinTime(Window *win,int K)
{
int Mark = 0, Min = 99999;
for (int i = 0; i < K; i++)
{
if (win[i].endtime < Min)
{
Min = win[i].endtime;
Mark = i;
}
}
return Mark;
}
bool cmp(Customer a,Customer b)
{
return a.arrTime < b.arrTime;
}
int main()
{  
int N, K;
cin >> N >> K;
Window *win = new Window[K];
Customer *cust = new Customer[N];
for (int i = 0; i < N; i++)
{
if (i == 5)
{
int ccc = 0;
}
int a=0, b=0, c=0;
scanf("%d:%d:%d %d",&a,&b,&c,&cust[i].dealTime);
cust[i].dealTime *= 60;
cust[i].arrTime = a * 3600 + b * 60 + c; 
if (cust[i].arrTime > 61200)
{
i -- ; N--;
}
}
sort(cust, cust + N,cmp);
float sum = 0;
for (int i = 0; i < N; i++)
{
int min = FindMinTime(win, K);
if (cust[i].arrTime < win[min].endtime)
{
cust[i].waitTime = win[min].endtime - cust[i].arrTime;
win[min].endtime = cust[i].dealTime + win[min].endtime;
}
else
{
cust[i].waitTime = 0;
win[min].endtime = cust[i].dealTime + cust[i].arrTime;
} 
sum += cust[i].waitTime;
}
sum /= float(N);
printf("%.1f", sum/60.0);
return 0;
}