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 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 containsai separated by spaces (1 ≤ ai ≤ 109). The third line containsk (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
Source

Northeastern Europe 2005, Northern Subregion

2分 关键注意整型

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>const int maxn = 100000 + 10 ;int a[maxn] ;using namespace std;int main() {    int k , n ;    while(~scanf("%d",&n)) {        for( int i = 0 ; i < n ; ++i ) {            scanf("%d",&a[i]) ;        }        sort( a , a + n )  ;        scanf("%d",&k) ;        if( k == 1) {            printf("%d\n",a[n-1]) ;            continue ;        }        int ans = 0 ;        int l =  1 , r = a[n-1] ;                        // 2分边界        while(l <= r) {                int mid = l+(r-l)/2;                int init = 0 , falg = 0;    <span style="white-space:pre"></span>//切忌定义为ans = 0 ；                   for( int i = 0 ; i < n ; ++i ) {                    if( a[i] > mid ){                        init += (a[i] - mid + k - 2)/(k-1) ;                      }                    if( init > mid ){                        falg  = 1 ;                        break;                    }            }            if( !falg ) {                r = mid -1 ;                ans = mid ;            }            else{                l = mid +1 ;            }        }        printf("%d\n",ans) ;    }    return 0    ;}