Submission #1177331

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#define FOR(i,k,n) for(int i=(k);i<=(n);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()  //greater<int>()
#define LL long long
using namespace std;

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

	if(2*N<=M){
		cnt=N+int((M-2*N)/4);
		cout<<cnt<<endl;
		return 0;
	}

	else {
		cnt=int(M/2);
		//cnt=cnt+int((N-cnt)/2);
		cout<<cnt<<endl;
		return 0;
	}
}

Submission Info

Judge Result