Codeforces Educational Round#98 A

A

思路：

考虑三种可能：要不要换，换1，换0

---

代码：

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
typedef long long LL;

int test=1;

int main()
{
	scanf("%d",&test);
	while(test--)
	{
		int x,y;
		cin >> x >> y;
		if(abs(x-y)<=1)
		{
			cout << x + y << '\n';
			continue;
		}
		cout << x + y + abs(x-y)-1 << '\n';
	}
	return 0;
}