for g in[*open(0)][1:]:a,b=sorted(map(int,g.split()));c=min(b-a,a);print(c+(a-c)*2//3)
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main()
{
int t;
cin >> t;
while(t--){
ll a,b;
cin >> a >> b;
if(a!=0 && b!=0){
if(2*a<b){
cout << a << endl;
}else if(a>2*b){
cout << b << endl;
}else{
cout << (a+b)/3 << endl;
}
}else{
cout << 0 << endl;
}
}
}
1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |
1358A - Park Lighting | 253C - Text Editor |
365B - The Fibonacci Segment | 75A - Life Without Zeros |
1519A - Red and Blue Beans | 466A - Cheap Travel |
659E - New Reform | 1385B - Restore the Permutation by Merger |
706A - Beru-taxi | 686A - Free Ice Cream |
1358D - The Best Vacation | 1620B - Triangles on a Rectangle |
999C - Alphabetic Removals | 1634C - OKEA |
1368C - Even Picture | 1505F - Math |
1473A - Replacing Elements | 959A - Mahmoud and Ehab and the even-odd game |
78B - Easter Eggs | 1455B - Jumps |
1225C - p-binary | 1525D - Armchairs |
1257A - Two Rival Students | 1415A - Prison Break |
1271A - Suits | 259B - Little Elephant and Magic Square |