# POJ 3104 Drying

http://poj.org/problem?id=3104

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

1.每分钟烘干k单位的水，于是当然地除k向上取整了((a[i] – mid) / k)。其实应该除以k-1，列个详细的算式：

k*x + (mid – x) >= a[i]，即 x >= (a[i] – mid) / (k – 1)。
2.当k=1的时候，很显然会发生除零错误，需要特判。
3.需要完全干，所以时间需要向上取整，即为(a[i]-mid+k-2)/(k-1)。

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#define N 100005
using namespace std;

int a[N];
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
int k,i,j;

for(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]);
else
{
int left=1,right=a[n-1],mid;

while(left<right)
{
long long sum=0;
mid=(left+right)/2;

for(i=0;i<n;i++)
{
if(a[i]>mid)
sum+=(a[i]-mid+k-2)/(k-1);

}
if(sum>mid)
left=mid+1;
else
right=mid;
}
printf("%d\n",left);

}
}
return 0;
}

• 本文已收录于以下专栏：

## POJ-3104 Drying

Drying Time Limit: 2000MS   Memory Limit: 65536K       Description ...

## POJ 3104 Drying

Drying Description It is very hard to wash and especially to dry clothes in winter. But Jane is ...

## POJ 3104 Drying

It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She ...

## POJ 3104 Drying

C - Drying Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u ...

## POJ 3104 Drying

DescriptionIt is very hard to wash and especially to dry clothes in winter. But Jane is a very smart...
• Zarth
• 2016-01-22 16:02
• 249

## poj 3104 Drying（二分）

Drying Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 13600   Accepted: 3499 ...

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)