A38285.组队问题

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
ll sum = 0;
ll a, b;
cin >> a >> b;
if (a < b) swap(a, b);
if (a >= 2 * b) sum = b;
else {
sum = a - b;
sum += (2 * b - a) / 3 * 2;
if ((2 * b - a) % 3 == 2) sum++;
}
cout << sum << endl;
}
return 0;
}