题解 | 小猫排队(模拟模拟模拟）

#include <iostream>
#include <vector>
using namespace std;

int n, t = 0, temp;
bool choose = 0;
vector<long long> arr;
long long lovely;
int main() {
    cin >> n;
    arr.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }
    cin >> lovely;
    while (true) {
        choose = 1;
        for (int i = n - 1; i >= t; --i) {
            if (arr[i] > lovely) {
                t++;
                n = i;
                choose = 0;
                break;
            }
        }
        if (choose) {
            t += (n - t + 1);
            break;
        }
    }
    cout << t;
}