题解 | 相差不超过k的最多数

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

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());

    int l = 0, res = 0;
    for (int r = 0; r < n; r++) {
        while (a[r] - a[l] > k) {
            l++;
        }
        res = max(res, r - l + 1);
    }
    cout << res << endl;
    return 0;
}