| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1354750 | settop | Rice Hub (IOI11_ricehub) | C++20 | 0 ms | 0 KiB |
#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fall(i,a,b) for(int i=a;i<=b;i++)
#define rfall(i,a,b) for(int i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define pb push_back
int besthub(int n, int L, int X[], long long B){
int ans=0;
fall(i,1,L){
vector<int> ord;
fall(j,0,n-1) ord.pb(abs(i-X[j]));
sort(all(ord));
int cur=0;
ll d=0;
for(auto u:ord) if(d+u<B) cur++,d+=u;
ans=max(ans,cur);
}
return ans;
}
int main(){
int n,L; cin>>n>>L;
int X[n];
fall(i,0,n-1) cin>>X[i];
ll B; cin>>B;
cout<<besthub(n,L,X,B)<<"\n";
}