POJ 3104 Drying

Description
It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She is not afraid of this boring process. Jane has decided to use a radiator to make drying faster. But the radiator is small, so it can hold only one thing at a time.
Jane wants to perform drying in the minimal possible time. She asked you to write a program that will calculate the minimal time for a given set of clothes.
There are n clothes Jane has just washed. Each of them took ai water during washing. Every minute the amount of water contained in each thing decreases by one (of course, only if the thing is not completely dry yet). When amount of water contained becomes zero the cloth becomes dry and is ready to be packed.
Every minute Jane can select one thing to dry on the radiator. The radiator is very hot, so the amount of water in this thing decreases by k this minute (but not less than zero — if the thing contains less than k water, the resulting amount of water will be zero).
The task is to minimize the total time of drying by means of using the radiator effectively. The drying process ends when all the clothes are dry.

---

【题目分析】
这题目，很容易想到贪心的方法，但是是错的（别问我，我也不知道）。然后考虑二分答案，二分之后的判定的方法很重要，我们先把他们全部减去自然风干的湿度，然后看在剩下的衣服中能否用机器在规定的时间内烘干。
注：向上取整的方法很有用

---

【代码】

#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
int a[100001];
int n,k;
inline bool test(int mid)
{
    int cnt=0;
    for (int i=1;i<=n;++i)
        if (a[i]>mid) 
        {
            cnt+=(a[i]-mid+k-2)/(k-1);
            if (cnt>mid) return false;  
        }
    return true;
}
int main()
{
    while (scanf("%d",&n)==1)
    {
        for (int i=1;i<=n;++i) scanf("%d",&a[i]);
        sort(a+1,a+n+1);
        scanf("%d",&k);
        if (k==1) {printf("%d\n",a[n]);continue;}
        int l=1,r=a[n];
        while (l<r)
        {
            int mid=(l+r)/2;
            if (test(mid))r=mid;
            else l=mid+1;
        }
        printf("%d\n",l);
    }
}