#NOIP2013J1Q25. [NOIP 2013 普及组初赛] 第 25 题

[NOIP 2013 普及组初赛] 第 25 题

#include <iostream>
using namespace std;
int main(){
    const int SIZE = 100;
    int n, f, i, left, right, middle, a[SIZE];
    cin >> n >> f;
    for (i = 1; i <= n; i++)
        cin >> a[i];
    left = 1;
    right = n;
    do {
        middle = (left + right) / 2;
        if (f <= a[middle])
            right = middle;
        else
            left = middle + 1;
    } while (left < right);
    cout << left << endl;
    return 0;
}

输入:

12 17

输出: 【第1空】

请填写答案。

{{ input(1) }}