題干：

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?Ai?steps. The steps of a dish should be finished sequentially. In each minute of the cooking,?Coach Gao?can choose at most?Mdifferent 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?Tindicating 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?Ai?(1 <=?Ai?<= 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道菜，給出每道菜所需步驟數(shù)。已知這個人每次同時能做m道菜的1步。問最少需要幾次把這些菜做完。

解題報告：

? ?貪心證明出答案是max( suma(a[i]) / m? ,? max(a[i]) )。

AC代碼：

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> #include<vector> #include<queue> using namespace std; typedef long long ll; const int maxn=20010; int n,m; queue<int> q; int main() {int t,i,j,k,l;ll ans,sum,tmp,mx;cin>>t;for(;t;t--){scanf("%d%d",&n,&m);sum=0;mx=0;for(i=0;i<n;i++){scanf("%lld",&tmp);sum+=tmp;mx=max(mx,tmp);}ans=ceil(sum*1.0/m);ans=max(ans,mx);printf("%lld\n",ans);}return 0; }

?

總結(jié)

以上是生活随笔為你收集整理的【ZOJ - 3778】Talented Chef（贪心）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。