分火腿C++ 北大oj

#include <cstdio>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn = 10010;
double huoTui[maxn];

//n代表火腿肠的总数 m Alice 要切的份数
int n, m;

bool check(double mid)
{
	int temp = 0;
	for (int i = 0; i < n; i++)
	{
		temp += huoTui[i] / mid;
	}
	if (temp >= m)
	{
		return true;
	}
	else {
		return false;
	}
}
int main()
{
	cin >> n >> m;

	for (int i = 0; i < n; i++)
	{
		cin >> huoTui[i];
	}
	sort(huoTui, huoTui + n);
	//
	double l = huoTui[0];
	double r = huoTui[n - 1];
	while (l <= r)
	{
		if (r - l < 0.0000001)
		{
			break;
		}
		double mid = (l + r) / 2.0;
		if (check(mid))
		{
			l = mid;
		}
		else {
			r = mid;
		}
	}
  int tmpmid = (int)(r*100);
  double finmid = tmpmid/100.0;
	//cout << r;
  printf("%.2lf",finmid);
}