这超时有DALAO能帮我解决吗555

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int fz[500001];
bool cmp(const int &x,const int &y)
{
    return x>y;
}
int main()
{
    int n,a,b,ans=0,i,j;cin>>n>>a>>b;
    for(i=1;i<=n;i++)scanf("%d",&fz[i]);
    sort(fz+1,fz+n+1,cmp);
    while(fz[1]>0)
    {
      fz[1]-=a+b;ans++;
      for(j=2;j<=n;j++)
        fz[j]-=a;
      int b=fz[1];j=1;
      while(fz[j+1]>b&&j<=n)
      {
          fz[j]=fz[j+1];
          j++;
      }
      fz[j]=b;
    }
    cout<<ans;
}