加减（双指针）

// Problem: 加减
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/20960/1028
// Memory Limit: 524288 MB
// Time Limit: 2000 ms
// 2022-03-12 14:43:29
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
void solve() {
	int n;
	ll k;
	cin >> n >> k;
	vector<ll> a(n + 1, 0), sum(n + 1, 0);
	for (int i =1; i<= n; i ++) cin >> a[i];
	sort(a.begin() +1, a.begin()+ 1 + n);
	for (int i =1; i<= n; i ++) sum[i] = sum[ i -1] + a[i];
	
	ll ans = 1;
	ll l = 1, r = 2;
	while (l <=n && r <= n) {
		int mid = l + r>>1;
		if (a[mid] * (mid - l + 1) - (sum[mid] - sum[l -1]) -
		a[mid] * (r - mid) + (sum[r] - sum[mid]) <= k) {
			ans = max (ans, r- l + 1);
			r ++;
		}
		else l ++;
		
	}
	cout << ans << endl;
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

对于一个尽量靠中间的数，是最优秀的选择。然后用尺子慢慢量.这种双指针的实现方式方便一点