显示代码纯文本
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=500000;
int a[maxn],c[maxn],x,b,n;
void Init();
int Ps(){
freopen("dry.in","r",stdin);
freopen("dry.out","w",stdout);
Init();
return 0;
}
int Pt=Ps();
int main(){
;
}
void Init(){
scanf("%d%d%d",&n,&x,&b);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
c[i]=(a[i]+x-1)/x;
}
int l=0,r=500000,ans=0x7f7f7f7f;
while(l<=r){
int mid=(l+r)>>1,temp=0;
for(int i=1;i<=n;i++){
if(c[i]>mid){
temp+=(a[i]-mid*x+b-1)/b;
}
}
if(temp<=mid){
if(mid<ans)ans=mid;
r=mid-1;
}
else l=mid+1;
}
printf("%d",ans);
}