openol G 100

#include <bits/stdc++.h>
// tiom4eg's precompiler options
// POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS
// IO settings
#define fastIO ios_base::sync_with_stdio(false); cin.tie(0)
// Quick types
#define ll long long
#define ld long double
//#define ull unsigned long long
#define pii pair <int, int>
#define vi vector <int>
#define mi vector <vector <int>>
// Quick functions
#define endl "\n"
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a.size())
#define pb push_back
#define mp make_pair
// Quick fors
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORS(i, a, b, c) for (int i = a; i < b; i += c)
#define RFOR(i, a, b) for (int i = a; i >= b; --i)
#define EACH(e, a) for (auto& e : a)
// Pragmas
#ifndef TIOM4EG
#pragma GCC optimize("O3") // let the chaos begin!
#pragma GCC target("avx,avx2,tune=native")
#pragma GCC comment(linker, "/stack:200000000")
#endif
// PBDS
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree <int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
// POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS POGGERS
using namespace std;
mt19937 rng(chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now().time_since_epoch()).count());
#define int long long
constexpr int INF = 1e9 + 7, MD = 998244353, MAX = 200007, LG = 19, R = 1 << LG, MOD = 1000000007, MOD2 = 1e9 + 9, B = 256;
const ll INFLL = 1e18 + 7;


signed main() {
    fastIO;
    int n, a, b; cin >> n >> a >> b;
    vi t(n); EACH(e, t) cin >> e, ++e;
    sort(all(t));
    if (t.back() <= 0) return !(cout << 0);
    if (n == 1) return !(cout << (t[0] + a - 1) / a);
    if (a == b) {
        if (t.back() <= 0) cout << 0;
        else cout << (t.back() + a - 1) / a;
        return 0;
    }
    if (a < b) {
        int d = b - a;
        int l = 0, r = 2 * INF;
        while (l < r - 1) {
            int m = (l + r) / 2, c = 0;
            if (t[n - 1] - b * m > 0) {
                l = m;
                continue;
            }
            FOR(i, 0, n) {
                int w = t[i] - b * m;
                c += -w / d;
                if (c >= m) break;
            }
            (c >= m ? r : l) = m;
        }
        cout << r;
    }
    else {
        int d = a - b;
        int l = 0, r = 2 * INF;
        while (l < r - 1) {
            int m = (l + r) / 2, c = 0;
            FOR(i, 0, n) {
                int w = t[i] - b * m;
                if (w >= 0) c += (w + d - 1) / d;
                if (c > m) break;
            }
            (c > m ? l : r) = m;
        }
        cout << r;
    }
}