题目链接
check()结果方程,先增后减,凸函数
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 200010;
//#define int long long
int T,x,y;
int check(int mid)
{
return mid+min((x-2*mid)/4,y-3*mid);
}
signed main()
{
cin>>T;
while(T--)
{
cin>>x>>y;
int l=0,r=min(x/2,y/3);
while(l<r)
{
int l1=l+(r-l)/3;
int r1=r-(r-l)/3;
if(check(l1)>check(r1))r=r1-1;
else l=l1+1;
}
cout<<check(l)<<endl;
}
}