题解 | 耕种时间到！

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

#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define int long long

int test(int in) {
    int out = ceil(double(in) / 3.0);
    return out;
}

signed main()
{
    IOS;

    int n;
    cin >> n;
    vector<int> a (n, 0);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int x = 0;
    cin >> x;

    sort(a.begin(), a.end());


    int num_min = x;
    int num_max = x;
    int num = 1;
    int ans = 0;
    int ans_max = 0;
    for (int i = 0; i < n; i++) {
        if (a[i] >= num_min && a[i] <= num_max) {
            ans += num;
            // cout << "a[" << i << "] = " << a[i] << endl;
            // cout << "num = " << num << endl;
        }

        if (a[i] < num_min) {
            continue;
        }

        if (a[i] > num_max) {
            num *= 2;
            num_min = num_min * 3 - 2;
            num_max = num_max * 3;
            i--;
            ans = 0;
        }
        if(ans > ans_max) {
            ans_max = ans;
        }
    }

    cout << ans_max << endl;




    return 0;
}