NYOJ 179 LK‘problem

LK's problem

时间限制： 3000 ms  |  内存限制： 65535 KB

难度： 1

描述

LK has a question.Coule you help her?

It is the beginning of the day at a bank, and a crowd  of clients is already waiting for the entrance door to  open. 

Once the bank opens, no more clients arrive, and  tellerCount tellers begin serving the clients. A  

teller takes serviceTime minutes to serve each client.  clientArrivals specifies how long each client has  already been waiting at the moment when the bank door  opens. Your program should determine the best way to arrange the clients into tellerCount queues, so that  the waiting time of the client who waits longest is minimized. The waiting time of a client is the sum of  the time the client waited outside before the bank opened, the time the client waited in a queue once the  bank opened until the service began, and the service time of the client. Return the minimum waiting time for the client who waits the longest.

输入

The input will consist of several test cases. For each test case, one integer N (1<= N <= 100) is given in the first line. Second line contains N integers telling us the time each client had waited.Third line contains tow integers , teller's count and service time per client need. The input is terminated by a single line with N = 0.

输出

For each test of the input, print the answer.

样例输入

2
1 2
1 10
1
10 
50 50
0

样例输出

21
60

题目大意：就是去银行排队。每个人的时间=银行开门前的等待时间+银行开门后的排队时间+银行办理时间（假设每个人的办理时间相同）

求出等待时间最长的最小值。基本思路是这样的：银行开门前的所有人等待时间排序一下，然后把时间最长的先办理。所有人办理好后，再把所用总时间排序，最大就是所求值。第一行输入N，代表N个人，第二行输入N个数，代表每个人在银行开门前的等待时间。第三行输入两个数，分别代表几个银行工作人员和办理需要多长时间。

代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
    int n,a[102],i,t,c,min,s[102],j,p;
    while(~scanf("%d",&n)&&n)
    {
        for(i=0;i<n;i++)
            scanf("%d",&a[i]);
       sort(a,a+n);     /*对开门前的等待时间排序*/
        scanf("%d%d",&c,&t);
        memset(s,0,sizeof(s));
        j=0,p=1;
        for(i=n-1;i>=0;i--)
        {
            if(j==c)
            {
                p++;    /*等待的人与银行工作人员的数目比较。*/
                j=0;
            }
            j++;
            s[i]=a[i]+p*t;     /*求出每个人所用的时间*/
        }
        sort(s,s+n);   /*再次排序*/
        printf("%d\n",s[n-1]);   /*输出最大值*/
    }
    return 0;
}