For this Question: You are given two integer N and M. You have to construct an array A having N non- negative integers such that the sum of its elements is M. As there are many such arrays possible, find the maximum <a href = "https://en.wikipedia.org/wiki/Median">median</a> of all such possible arrays.The first line of the input contains two integers N and M.

Constraints:
1 <= N, M <= 10<sup>9</sup>Print the maximum median possible.Sample Input:
3 5

Sample Output:
2

Explanation:
One possible array: [1, 2, 2], I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
    int n, s;
    cin >> n >> s;
    int l = 0, r = s + 1;
    while (r - l > 1) {
        int M = (l + r) / 2;
        int m = n / 2 + 1;
        if (m * M <= s) {
            l = M;
        } else {
            r = M;
        }
    }
    cout << l;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?