【2019牛客多校第六场D Move】【二分】

链接：https://ac.nowcoder.com/acm/contest/886/D
来源：牛客网
 

题目描述

After the struggle of graduating from college, TangTang is about to move from a student apartment to his new home.

TangTang has n items to move, the i-th of which is of volume viv_ivi​. He can pack all these items into at most K boxes of the same volume.
 

TangTang is so clever that he uses the following strategies for packing items:

 

- Each time, he would put items into a box by the next strategy, and then he would try to fill another box.

- For each box, he would put an unpacked item of the largest suitable volume into the box repeatedly until there is no such item that can be fitted in the box.

Now, the question is what is the minimum volume of these boxes required to pack all items.

输入描述:

There are multiple test cases. The first line contains an integer T (1≤T≤201 \leq T \leq 201≤T≤20), indicating the number of test cases. Test cases are given in the following.

For each test case, the first line contains two integers n, K (1≤n,K≤10001 \leq n, K \leq 10001≤n,K≤1000), representing the number of items and the number of boxes respectively.

The second line contains n integers v1v_1v1​, v2v_2v2​, …\ldots…, vnv_nvn​ (1≤v1,v2,…,vn≤10001 \leq v_1, v_2, \ldots, v_n \leq 10001≤v1​,v2​,…,vn​≤1000), where the i-th integer viv_ivi​ represents the volume of the i-th item.

输出描述:

For each test case, output "Case #x: y" in one line (without quotes), where x indicates the case number starting from 1, and y denotes the answer to this test case.

示例1

输入

复制

1
5 3
1 2 3 4 5

输出

复制

Case #1: 5

题目大意：n件物品，m个箱子，每次拿一个箱子过来，不断塞当前能承受最大体积的物品，放不下的时候在拿一个箱子过来，求箱子的最小容积

题解：

• 首先这道题箱子容积和答案没有单调性

• 比如：

• 15 5

• 39 39 39 39 39 60 60 60 60 60 100 100 100 100 100

• 199 为一个合法的答案，但 200 不是，201 也不是。

考虑到答案下界显然为 ceil(sum / k)

check 一个答案的复杂度为 O(nlogn)

所以我们直接在这个范围内枚举答案，复杂度为 O(maxV * nlogn)

#include <bits/stdc++.h>
using namespace std;
int a[1005];
int num,k;
bool check(int maxv){
    multiset<int>s;
    s.clear();
    for(int i=1;i<=num;i++){
        s.insert(a[i]);
    }
    multiset<int>::iterator it;
    for(int i=1;i<=k;i++){
        int now=maxv;
        while(now>=0&&s.size()>0){
            it=s.upper_bound(now);
            if(it==s.begin())
                break;
            it--;
            now-=*it;
            if(now>=0){
                s.erase(it);
            }
            else{
                break;
            }
        }
    }
    if(s.size()==0){
        return true;
    }
    else{
        return false;
    }
}
int main(){
    int tnum;
    cin>>tnum;
    int cnt=1;
    while(tnum--){
        
        cin>>num>>k;
        int sum=0;
        for(int i=1;i<=num;i++){
            cin>>a[i];
            sum+=a[i];
        }
        cout<<"Case #"<<cnt<<": ";
        cnt++;
        for(int i=(sum/k);;i++){
            if(check(i)){
                cout<<i<<endl;
                break;
            }
        }
        
    }
}