Drying

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.

Input

The first line contains a single integer n (1 ≤ n ≤ 100 000). The second line contains ai separated by spaces (1 ≤ ai ≤ 109). The third line contains k (1 ≤ k≤ 109).

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

题意
Jane有一台烘干机，她想利用最短的时间把所有的湿衣服都烘干。烘干机上一次只能放一件衣服，放置的时间都是整数。衣服不在烘干机上每单位时间减少1点水分，在烘干机上的每单位时间减少k点水分。 

分析

1，首先我们肯定是用二分法解决问题

2，二分法我们需要的两个条件，二分的区间，判定的条件

区间：因为是二分查找所以我们可以吧区间开的大一点，左边间取零，右边界取自然风干的时间

条件：想在mid时间内全部烘干就需要占用烘干机。假设占用烘干机xi时间，因为最后能烘干的话，就有 ai <= k xi+(mid - xi)成立，也就是xi >= (ai - mid) / (k-1)。 将所有的xi向上取整累加，如果超过mid，说明不可行；如果不超过mid则表示时间够用。（向上取整可以采用xi = (ai-mid + k-2)/(k-1)得到） 

AC代码

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
#define maxn 100010
#define LL long long
using namespace std;
 
LL a[maxn],b[maxn];
LL n,k;
bool ck(LL x)
{
    for(LL i=1;i<=n;++i)  
    b[i] = a[i]-x;
    LL cnt = 0;
    for(LL i=1;i<=n;++i){
        if(b[i]>0){
            if(b[i]%(k-1)==0)   
           cnt+=b[i]/(k-1);
            else
          {cnt+=b[i]/(k-1);
         cnt++;}
        }
    }
    if(cnt>x)  
    return true;
    else        
   return false;
}
int main()
{
    while(scanf("%lld",&n)!=EOF){
        for(LL i=1;i<=n;++i){
            scanf("%lld",&a[i]);
        }
        sort(a+1,a+1+n);
        scanf("%lld",&k);
        if(k==1)
     {printf("%lld\n",a[n]);
         continue;}
        LL l=0,r=a[n],mid=0;
        while(l<r-1){
            mid = l+(r-l)/2;
            if(ck(mid))
            l = mid;
            else        
            r = mid;
        }
        printf("%lld\n",r);
    }
    return 0;
}