是二分查找

#include<cstdio>
using namespace std;
int n,f,i,x[1000000],l=1,r=10000,s,mid;
int main()
{
  scanf("%d%d",&n,&f);
  for(i=1;i<=n;i++)scanf("%d",&x[i]);
  while(l<=r)
  {
      mid=(l+r)/2;
      s=0;
      for(i=1;i<=n;i++)s+=x[i]/mid;
      if(s<f)r=mid-1;else l=mid+1;
  }
  printf("%d",l-1);
  return 0;
}