poj 1064 java_POJ 1064 Cable master

Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to connect computers for the contestants using a “star” topology - i.e. connect them all to a single central hub. To organize a truly honest contest, the Head of the Judging Committee has decreed to place all contestants evenly around the hub on an equal distance from it.

To buy network cables, the Judging Committee has contacted a local network solutions provider with a request to sell for them a specified number of cables with equal lengths. The Judging Committee wants the cables to be as long as possible to sit contestants as far from each other as possible.

The Cable Master of the company was assigned to the task. He knows the length of each cable in the stock up to a centimeter,and he can cut them with a centimeter precision being told the length of the pieces he must cut. However, this time, the length is not known and the Cable Master is completely puzzled.

You are to help the Cable Master, by writing a program that will determine the maximal possible length of a cable piece that can be cut from the cables in the stock, to get the specified number of pieces.

Input

The first line of the input file contains two integer numb ers N and K, separated by a space. N (1 = N = 10000) is the number of cables in the stock, and K (1 = K = 10000) is the number of requested pieces. The first line is followed by N lines with one number per line, that specify the length of each cable in the stock in meters. All cables are at least 1 meter and at most 100 kilometers in length. All lengths in the input file are written with a centimeter precision, with exactly two digits after a decimal point.

Output

Write to the output file the maximal length (in meters) of the pieces that Cable Master may cut from the cables in the stock to get the requested number of pieces. The number must be written with a centimeter precision, with exactly two digits after a decimal point.

If it is not possible to cut the requested number of pieces each one being at least one centimeter long, then the output file must contain the single number “0.00” (without quotes).

Sample Input

4 11

8.02

7.43

4.57

5.39

Sample Output

2.00

题目大意，有N条线段，要求分成K段。问最大每段能分多长。

思路：类似于pie那题，本题中，每条原始线段不一定都非要用，可以不用，只要最后能分到K条线段即可。那么二分的上下界即，下界为0，上界为单条线段的最长长度，即100公里。对于每个mid，判断以这个长度，可以切出多少根线段，如果比要求的K多，即这个mid可行，换更大的mid试，即le=mid，反之ri=mid。

注意的问题。在数据输出时，如果只是保留两位输出，那么最后一位会自动四舍五入，答案是错的，应当向下取整。

代码

#include

#include

int N,K;

double a[10009],esp=1e-6;

bool fun(double mid)

{

int cnt=0;

for(int i=0;i

cnt+=a[i]/mid;

return cnt>=K;

}

int main()

{

while(~scanf("%d%d",&N,&K))

{

for(int i=0;i

scanf("%lf",&a[i]);

double le=0.0,ri=100001,mid;

while(ri-le>esp)

{

mid=(le+ri)/2;

if(fun(mid))

le=mid;

else

ri=mid;

}

printf("%.2f\n",floor(ri*100)/100);

}

return 0;

}