zoj3778 Talented Chef

最新推荐文章于 2019-03-21 21:29:32 发布

weixin_30908649

最新推荐文章于 2019-03-21 21:29:32 发布

阅读量98

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/code-painter/p/3735157.html

本文讨论了厨师高如何在有限时间内准备最多菜肴的问题，通过比较最长烹饪时间和总烹饪时间除以同时烹饪的菜肴数量，以找到完成所有菜肴所需的最少时间。详细介绍了算法实现过程，包括输入数据解析、数据处理和输出结果。此算法适用于需要高效时间管理的烹饪场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

As we all know, Coach Gao is a talented chef, because he is able to cook M dishes in the same time. Tonight he is going to have a hearty dinner with his girlfriend at his home. Of course, Coach Gao is going to cook all dishes himself, in order to show off his genius cooking skill to his girlfriend.

To make full use of his genius in cooking, Coach Gao decides to prepare N dishes for the dinner. The i-th dish contains A_i steps. The steps of a dish should be finished sequentially. In each minute of the cooking, Coach Gao can choose at most M different dishes and finish one step for each dish chosen.

Coach Gao wants to know the least time he needs to prepare the dinner.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains two integers N and M (1 <= N, M <= 40000). The second line contains N integers A_i (1 <= A_i <= 40000).

Output

For each test case, output the least time (in minute) to finish all dishes.

Sample Input

2
3 2
2 2 2
10 6
1 2 3 4 5 6 7 8 9 10

Sample Output

3
10

题目大意：给出n（表示有n道菜）、m（表示能同时煮m道菜），给出每道菜的时间，求最少需要煮多久。

思路：直接比较时间最长那道菜和总时间除以m的值哪个最大，取最大的即可。因为要嘛就是煮完的时候要嘛就是时间最长那道菜的时间，要嘛就是总时间除以m。

代码如下

 1 /*
 2  * Author:  Joshua
 3  * Created Time:  2014/5/18 13:30:03
 4  * File Name: c.cpp
 5  */
 6 #include<cstdio>
 7 
 8 void solve()
 9 {
10     int n,m,max=0,ans,sum=0;
11     int a[40005];
12     scanf("%d%d",&n,&m);
13     for (int i=1;i<=n;i++)
14     {
15         scanf("%d",&a[i]);
16         if (a[i]>max) max=a[i];
17         sum+=a[i];
18     }
19     if ((sum-1)/m+1 >max) printf("%d\n",(sum-1)/m+1);
20     else printf("%d\n",max);
21 }
22 
23 int main()
24 {
25     int times;
26        scanf("%d",&times);
27        while (times)
28        {
29            times--;
30            solve();
31        }
32     return 0;
33 }