NYOJ 179-LK's problem【模拟】
来源:互联网 发布:台湾战机失联 知乎 编辑:程序博客网 时间:2024/05/17 02:57
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. Ateller 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.
- 样例输入
21 21 10110 50 500
- 样例输出
2160
- 来源
- TOPCODER
- 上传者
iphxer
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){int n,i,j,a,b;int c[110],d[110];while(scanf("%d",&n)&&n){for(i=0;i<n;i++){scanf("%d",&c[i]);}scanf("%d%d",&a,&b);sort(c,c+n);for(j=0,i=n-1;i>=0;i=i-a,j++){d[j]=c[i]+b*(j+1);}sort(d,d+j);printf("%d\n",d[j-1]);}}
0 0
- NYOJ 179-LK's problem【模拟】
- NYOJ 179 LK's problem
- NYOJ 179 LK's problem
- NYOJ 179 LK's problem ......
- NYOJ 179 LK's problem (排序模拟)
- NYOJ 179题 LK's problem
- NYOJ 179 LK's problem【贪心】
- NYOJ 179 LK‘problem
- LK's problem 05
- 179.LK's problem
- nyoj 291-LK的数学题
- NYOJ 291 LK的数学题
- nyoj-291-LK的数学题
- Codeforces 30D King's Problem? 模拟
- HDU 5615:Jam's math problem【模拟】
- Far Relative’s Problem(贪心模拟)
- LK ARM64 start.S处理
- LK ARM64 asm.S处理
- POJ2752 Seek the Name, Seek the Fame
- Java开发牛人十大必备网站
- 专家称区块链技术未来将颠覆当前货币发行机制
- opensuse中texlive中找不到已经安装好的.sty文件,Latex can't find .sty files altough packages are installed
- 2659: [Beijing wc2012]算不出的算式
- NYOJ 179-LK's problem【模拟】
- 34家技术公司成立日本的区块链集团
- HDU 4004 The Frog's Games (二分)
- Matches Game(POJ_2234)
- wait_event_interruptible() 分析
- 模拟实现C语言中的字符串函数
- 机器学习之神经网络模型-上(Neural Networks: Representation)
- 成为JavaGC专家(1)—深入浅出Java垃圾回收机制
- Boost多索引容器代码示例