3089119_wa.cc

来自「北大大牛代码 1240道题的原代码 超级权威」· CC 代码 · 共 40 行

#include <stdio.h>
#include <math.h>

int main()
{
	int n, k, i;
	double min, max, mid;
	int cnt;

	scanf("%d%d",&n,&k);
	double len[n];
	cnt = 0;
	for(i = 0; i < n; i++)
	{
		scanf("%lf",&len[i]);
		cnt += (int)(floor(len[i]));
	}
	if(cnt < k)
	{
		puts("0.00");
		return 0;
	}
	min = 1.00;max = 100.00;
	while(max - min > 1e-5)
	{
		mid = (max+min)/2;
		cnt = 0;
		for(i = 0; i < n; i++)
		{
			cnt += (int)(floor(len[i]/mid));
		}
		if(cnt < k)
			max = mid;
		else
			min = mid;
	}
	printf("%.2lf\n",min);
	return 0;
}