A. Sweet Problem（思维题贪心）

本文主要是介绍A. Sweet Problem（思维题贪心），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

题目
A. Sweet Problem
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Input
The first line contains integer t (1≤t≤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≤r,g,b≤108) — the number of red, green and blue candies, respectively.

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

Example
inputCopy
6
1 1 1
1 2 1
4 1 1
7 4 10
8 1 4
8 2 8
outputCopy
1
2
2
10
5
9
Note
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.
这是第一次cf上a的第一个题（当时脑子一抽懵着做对）
哈哈开心

AC代码

#include <bits/stdc++.h>using namespace std;
int a[3];
int main()
{int t;cin>>t;while(t--){int ans;for(int i=1; i<=3; i++)cin>>a[i];sort(a+1,a+4);if(a[3]>(a[1]+a[2]))ans=a[1]+a[2];elseans=(a[1]+a[2]+a[3])/2;cout<<ans<<endl;}return 0;
}