问题 K: 2017J-完善2-二分-切割绳子

#include<iostream>
using namespace std;
int n, m, i, lbound, ubound, mid, count;
int len[100]; // 绳子长度
int main(){
    cin >> n;
    count = 0;
    for (i = 0; i < n; i++){
        cin >> len[i];
        ①;
    }
    cin >> m;
    if (②){
        cout << "Failed" << endl;
        return 0;
    }
    lbound = 1;
    ubound = 1000000;
    while (③) {
        mid = ④;
        count = 0;
        for (i = 0; i < n; i++)
            ⑤;
        if (count < m)
            ubound = mid - 1;
        else
            lbound = mid;
    }
    cout << lbound << endl;
    return 0;

	}