输入格式

第一行是人数 n 和面包数目 m (3<= n <= 16 , 1 <= m <= 100)，第二行 m 个数字表示 m 个面包的长度 L ，均为整数( 1 <= L <= 1000000)

输出格式

每人分得的最长面包长度，保留2位小数

 #include<iostream>

 #include<cstring>

 #include<cstdio>

 #include<cmath>

 #include<algorithm>

 using namespace std;

 int store[];

 int main()

 {

 //    freopen("input.txt", "r", stdin);

     int n, m, cnt = , len;

     double res = ;

     scanf("%d%d", &n, &m);

     memset(store, , sizeof(store));

     for(int i=; i<m; ++i)

     {

         scanf("%d", &len);

         store[cnt++] = len;

     }

     sort(store, store+cnt);

     double mid, maxn = store[cnt-], minn = ;

     int sum = , flag = ;

     mid = (minn + maxn)/;

     while(maxn - minn > 0.000001)

     {

         mid = (minn + maxn)/;

         sum = ;

         for(int i=cnt-; i>=; --i)

         {

             int temp = (int)floor(1.0*store[i]/mid);

             sum += temp;

             if(sum >= n || store[i] < mid) break;

         }

         if(sum >=n) minn = mid;

         else maxn = mid;

     }

     printf("%.2lf\n", mid);

     return ;

 }