CF1263A Sweet Problem

### 题意简述 有三堆糖果，在同一堆中的糖果颜色相同，但没有两堆糖果的颜色是一样的。 你每天要吃掉两个糖果，但不能吃掉两个颜色相同的糖果。你最多可以吃多少天？

第一行一个正整数 $t(1\leq t \leq 1000)$ 测试数据的数量。 对于每组测试数据，在一行有三个正整数 $r,g,b(1\leq r,g,b \leq 10^8)$，表示每堆糖果的数量。

对于每组测试数据，输出一个整数，表示最多可以吃的天数。 翻译贡献者 U108949

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.