CF1263A.Sweet Problem

You have three piles of candies: red, green and blue candies:

• the first pile contains only red candies and there are $r$ candies in it,
• the second pile contains only green candies and there are $g$ candies in it,
• the third pile contains only blue candies and there are $b$ candies in it.

Each day Tanya eats exactly two candies of different colors. She is free to choose the colors of eaten candies: the only restriction that she can't eat two candies of the same color in a day.

Find the maximal number of days Tanya can eat candies? Each day she needs to eat exactly two candies.

你有三堆糖果：红色、绿色和蓝色糖果：

• 第一堆只包含红色糖果，共有 $r$ 颗；
• 第二堆只包含绿色糖果，共有 $g$ 颗；
• 第三堆只包含蓝色糖果，共有 $b$ 颗。

塔尼娅每天恰好吃两颗颜色不同的糖果。她可以自由选择所吃糖果的颜色，唯一限制是：她每天不能吃两颗相同颜色的糖果。

求塔尼娅最多能吃多少天？每天她必须恰好吃两颗糖果。

The first line contains integer $t$ ($1 \le t \le 1000$) — the number of test cases in the input. Then $t$ test cases follow.

Each test case is given as a separate line of the input. It contains three integers $r$, $g$ and $b$ ($1 \le r, g, b \le 10^8$) — the number of red, green and blue candies, respectively.

第一行包含一个整数 $t$（$1 \le t \le 1000$）—— 输入中测试用例的数量。随后是 $t$ 个测试用例。

每个测试用例在输入中占单独一行，包含三个整数 $r$、$g$ 和 $b$（$1 \le r, g, b \le 10^8$），分别表示红色、绿色和蓝色糖果的数量。

Print $t$ integers: the $i$-th printed integer is the answer on the $i$-th test case in the input.

输出 $t$ 个整数：第 $i$ 个输出的整数为输入中第 $i$ 个测试用例的答案。

In the first example, Tanya can eat candies for one day only. She can eat any pair of candies this day because all of them have different colors.

In the second example, Tanya can eat candies for two days. For example, she can eat red and green candies on the first day, and green and blue candies on the second day.

In the third example, Tanya can eat candies for two days. For example, she can eat red and green candies on the first day, and red and blue candies on the second day. Note, that two red candies will remain uneaten.

在第一个例子中，塔尼娅只能吃一天糖果。她当天可以吃任意一对糖果，因为所有糖果的颜色都不同。

在第二个例子中，塔尼娅可以吃两天糖果。例如，她第一天可以吃红色和绿色糖果，第二天可以吃绿色和蓝色糖果。

在第三个例子中，塔尼娅可以吃两天糖果。例如，她第一天可以吃红色和绿色糖果，第二天可以吃红色和蓝色糖果。注意，将剩下两颗红色糖果未被吃掉。