№6 COPP

#include <iostream>
#include <string>
#include <vector>
#include <climits>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin >> n;

    int m;
    cin >> m;

    vector<int> list;

    int maxSubstr = 0;
    int minVal = INT_MAX;

    for(int i = 0; i < n; i ++) {
        int a;
        cin >> a;
        if(a >= m) {

        }
        else {
            minVal = INT_MAX;
        }
    }

    cout << maxSubstr;

   return 0;
}