Submission #1116155

---

Source Code Expand

const bool TEST=1;
#include<iostream>
#include<cctype>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<cctype>
#include<cstring>
#include<utility>
#include<cmath>
#include<sstream>
#include<stack>
const int inf=0x7fffffff;
#define IF if(TEST)
#define FI if(!TEST)
#define gts(s) fgets((s),sizeof(s),stdin)
#define ALL(s) (s).begin(),(s).end()
#define MK(a,b) make_pair((a),(b))
typedef long long int LL;
typedef unsigned int U;
typedef unsigned long long ULL;
using namespace std;
typedef pair<int,int> Point;
template <typename T>
void pA(T *begin,int n){ for(int i=0;i<n;i++){ cout<<*(begin++); } printf("\n"); }
void sol(){
	ULL n,m;
	cin>>n>>m;
	ULL ans=0;
	ULL N;
	N=min(n,m/2);
	ans+=N;
	m-=2*N;
	ans+=m/4;
	cout<<ans<<endl;
}
int main()
{
	sol();
	return 0;
}
//C.cc
//generated automatically at Sat Feb 18 20:06:36 2017
//by xsthunder

Submission Info

Judge Result