# [二分-最小化最大值] - poj3104-Drying

Drying
 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20853 Accepted: 5246

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.

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

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e5+10;
ll arr[maxn],n,k,sum;
bool check(ll mid) {
ll temp,cnt;
for(int i=0,j=mid;i<n;i++) {
temp = arr[i] - mid;
if(temp > 0) {
if(j) {
cnt = temp / k;
if(temp % k) cnt++;
if(j >= cnt) j-=cnt;
else return false;
}
else return false;
}
}
return true;
}
int main()
{
while(~scanf("%lld",&n)){
ll left = 0,right = 0,sum = 0;
for(int i=0;i<n;i++) scanf("%lld",&arr[i]), right = max(arr[i],right);
scanf("%lld",&k);k--;
if(k == 0){
printf("%lld\n",right);
continue;
}
while(left <= right) {
ll mid = (left + right) >> 1;
if(check(mid)) right = mid - 1;
else left = mid + 1;
}
printf("%lld\n",left);
}
return 0;
}


03-28 105

09-03 2652

07-23 2665

08-16 2945

02-04 60

07-18 528

04-19 82

01-25 439

11-04 1159

07-19 377

• 写评论