Submission #1778785

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<vector>
#include<map>
#define N 100100
#define abs(x) return x>0?x:(-x)
#define sqr(x) return x*x
typedef long long ll;
using namespace std;
// coding........
ll w[N],v[N];
ll n;
ll a,b;
bool Check(ll x)
{
    ll num,ans=x,sum;
    for (int i=0;i<n;i++)
        v[i]=w[i];
    for (int i=0;i<n;i++)
    {
        v[i]-=x*b;
       if (v[i]>0)
       {
         if (v[i]%(a-b)==0)
            num=v[i]/(a-b);
        else
            num=(v[i]/(a-b)+1);
        ans-=num;
       }

    }
    if (ans<0)
        return false;
    else
        return true;
}
int main()
{
    scanf("%d%d%d",&n,&a,&b);
    for (int i=0;i<n;i++)
      scanf("%d",&w[i]);
    sort(w,w+n);
     ll  lb=0,ub=w[n-1];
    while(ub-lb>1){
         ll mid=(lb+ub)/2;
         if(Check(mid)) ub=mid;
         else  lb=mid;
    }
    cout << ub << endl;
    return 0;
}

Submission Info

Judge Result