For this Question: Australia hasn’t lost a Test Match at the Gabba since 1988. India has to win this one, but unfortunately all of their players are injured.

You are given the following information:
1. A total of N players are available, all are injured initially.
2. You have M magic pills. Using X pills, you can make any one player fit for match.
3. Alternatively, you can exchange any player for Y magic pills.

Compute the maximum number of players you can make fit for the Gabba Test Match.

Note: "Exchanging" a player means that player will no longer be available and you will gain Y extra magic pills for the exchangeThe input contains a single line containing 4 integers N M X Y.

Constraints:-
0 ≤ N, M, X, Y ≤ 10^9The output should contain a single integer representing the maximum number of players you can make fit before the match.Sample Input:-
5 10 2 1

Sample Output:-
5

Explanation:-
You can make all players fit if you use all the pills.

Sample Input:-
3 10 4 2

Sample Output:-
2

Explanation:-
You can make 2 players fit using the initial candies. Otherwise, Exchanging one player would result in a total of 10+2=12 magic pills. This is enough to make 3 players fit, but you won't have 3 players remaining., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;

#define LL long long

void solve() {
    LL n, m, x, y;
    cin >> n >> m >> x >> y;
    LL l = 0, r = n + 1, mid;
    while(l < r-1) {
        mid = (l + r) / 2;
        if(mid * x <= m + (n - mid) * y) l = mid;
        else r = mid;
    }    
    cout << l << '\n';
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    
    int tt = 1; //cin >> tt;
    while(tt--) solve();
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?