POJ - 3104 Drying

#include <iostream>
#include <stdio.h>
using namespace std;

int main()
{
    long long n,k,i,t,m,high,low,mid;
    long long a[100010];
    while(cin>>n){
        high=0;
        low=0;
        for(i=0;i<n;i++){
            scanf("%lld",&a[i]);
            if(a[i]>high){
                high=a[i];
            }
        }
        cin>>k;
        if(k==1){
            cout<<high<<endl;
            continue;
        }

        while(low<high-1){
            mid=(low+high)/2;
            m=0;
            for(i=0;i<n;i++){

                if(a[i]>mid){
                    m=m+((a[i]-mid+k-2)/(k-1));
                }
            }
            if(m>mid){
                low=mid;
            }else{
                high=mid;
            }
        }
        cout<<high<<endl;
    }
    return 0;
}

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 a_i 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 byk 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.

Input

The first line contains a single integer n (1 ≤ n ≤ 100 000). The second line containsa_i separated by spaces (1 ≤a_i ≤ 10⁹). The third line containsk (1 ≤ k ≤ 10⁹).

Output

Output a single integer — the minimal possible number of minutes required to dry all clothes.

Sample Input

sample input #1
3
2 3 9
5

sample input #2
3
2 3 6
5

Sample Output

sample output #1
3

sample output #2
2

Source

衣服每分钟自然风干1滴水，烘干机每分钟烘干K滴水，此时不计算自然烘干，可以理解成烘干机烘干k-1水的同时自然风干1水。

因此只需要排序后选出ai>mid的衣服，(ai-mid)/(k-1)向上取整，注意用ceil函数会有毛病，要写成(ai-mid+k-2)/(k-1)。

另外要考虑k=1的特殊情况，即相当于全部自然风干，输出ai最大值即可

这题明明题面上说数值小于10^9，但是用int还是会错，改成long long才过，很莫名其妙