A13510 | $Shovels and Swords$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Polycarp plays a well-known computer game (we won't mention its name). In this game, he can craft tools of two types — shovels and swords. To craft a shovel, Polycarp spends two sticks and one diamond; to craft a sword, Polycarp spends two diamonds and one stick. Each tool can be sold for exactly one emerald. How many emeralds can Polycarp earn, if he has $a$ sticks and $b$ diamonds?

The first line contains one integer $t$ ( $1 \le t \le 1000$ ) — the number of test cases. The only line of each test case contains two integers $a$ and $b$ ( $0 \le a, b \le 10^9$ ) — the number of sticks and the number of diamonds, respectively.

For each test case print one integer — the maximum number of emeralds Polycarp can earn.

输入 #1

4
4 4
1000000000 0
7 15
8 7

输出 #1

C++ 编辑器

输入

输出