PAT 甲级 1017  Queueing at Bank

1017 Queueing at Bank （25 point(s)）

Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wait in line behind the yellow line, until it is his/her turn to be served and there is a window available. It is assumed that no window can be occupied by a single customer for more than 1 hour.

Now given the arriving time T and the processing time P of each customer, you are supposed to tell the average waiting time of all the customers.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 numbers: N (≤10​4​​) - the total number of customers, and K (≤100) - the number of windows. Then N lines follow, each contains 2 times: HH:MM:SS - the arriving time, and P - the processing time in minutes of a customer. Here HH is in the range [00, 23], MM and SS are both in [00, 59]. It is assumed that no two customers arrives at the same time.

Notice that the bank opens from 08:00 to 17:00. Anyone arrives early will have to wait in line till 08:00, and anyone comes too late (at or after 17:00:01) will not be served nor counted into the average.

Output Specification:

For each test case, print in one line the average waiting time of all the customers, in minutes and accurate up to 1 decimal place.

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

Experiential Summing-up

This question is PAT 甲级 1014 Waiting in Line's simplified version. When a time with HH:mm:ss format convert into a integer, and notice the maximum time of sever not more than 60 minutes. This question will become so easy~~

 (The purpose of using English to portray my solution is that to exercise the ability of my expression of English and accommodate PAT advanced level's style.We can make progress together by reading and comprehending it. Please forgive my basic grammar's and word's error. Of course, I would appreciated it if you can point out my grammar's and word's error in comment section.( •̀∀•́ ) Furthermore, Big Lao please don't laugh at me because I just a English beginner settle for CET6    _(:з」∠)_  )

Accepted Code

#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
const int INF=0x3fffffff;
int k;
struct customer
{
	int arrive,serve;
};
bool cmp(customer a,customer b)
{
	return a.arrive<b.arrive;
}
int convert(int h,int m,int s)
{
	return h*3600+m*60+s;
}
int search(int a[])
{
	int min=INF,index=-1;
	for(int i=0;i<k;++i)
	{
		if(a[i]<min)
		{
			min=a[i];
			index=i;
		}
	}
	return index;
}
int main()
{
	int n,h,m,s,p;
	scanf("%d %d",&n,&k);
	int w[110],start=convert(8,0,0),end=convert(17,0,0);
	for(int i=0;i<k;++i)
	{
		w[i]=start;
	}
	vector<customer> cus;
	double ans=0;
	for(int i=0;i<n;++i)
	{
		scanf("%d:%d:%d %d",&h,&m,&s,&p);
		int cometime=convert(h,m,s);
		if(cometime<=end)
		{
			customer a;
			a.arrive=cometime;
			a.serve=p<60?p*60:3600;
			cus.push_back(a);
		}
	}
	sort(cus.begin(),cus.end(),cmp);
	for(int i=0;i<cus.size();++i)
	{
		int loc=search(w);
		if(w[loc]<cus[i].arrive)
		{
			w[loc]=cus[i].arrive+cus[i].serve;
		}
		else
		{
			ans+=w[loc]-cus[i].arrive;
			w[loc]+=cus[i].serve;
		}
	}
	printf("%.1f\n",ans/(60*cus.size()));
	return 0;
}