Submission #1807489

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <cmath>

#define	MOD 1000000007;
#define PI 3.14159265358979323846;
using namespace std;
typedef long long ll;
ll mod = 1000000007;

int main()
{
	int N, M;
	cin >> N >> M;

	int P = 0;
	if (2 * N - M <= 0)
	{
		P = N;
		P += (M - 2 * N) / 4;
	}
	else {
		P = M / 2;
	}

	cout << P << endl;
	return 0;
}

Submission Info

Judge Result