Submission #1680987

---

Source Code Expand

#include <iostream>
#include <algorithm>

using namespace std;

int main() {
    int N, M;
    cin >> N >> M;
    int p = (M - 2 * N) / 4;

    int ans = 0;
    if (p < 0) {
        ans = min(M, N / 2);
    } else {
        for (int i = -1; i <= 1; ++i) {
            ans = max(ans, min(N + p + i, (M - 2 * p - 2 * i) / 2));
        }
    }

    cout << ans << endl;
}

Submission Info

Judge Result