Sweet Problem

题意翻译

### 题意简述 有三堆糖果，在同一堆中的糖果颜色相同，但没有两堆糖果的颜色是一样的。 你每天要吃掉两个糖果，但不能吃掉两个颜色相同的糖果。你最多可以吃多少天？ ### 输入格式 第一行一个正整数 $t(1\leq t \leq 1000)$ 测试数据的数量。 对于每组测试数据，在一行有三个正整数 $r,g,b(1\leq r,g,b \leq 10^8)$，表示每堆糖果的数量。 ### 输出格式 对于每组测试数据，输出一个整数，表示最多可以吃的天数。 翻译贡献者 U108949

题目描述

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.

输入输出格式

输入格式

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.

输出格式

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

输入输出样例

输入样例 #1

6
1 1 1
1 2 1
4 1 1
7 4 10
8 1 4
8 2 8

输出样例 #1

1
2
2
10
5
9

说明

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.