【cf478C】Table Decorations

2014年10月17日1,1430

You have r red, g green and b blue balloons. To decorate a single table for the banquet you need exactly three balloons. Three balloons attached to some table shouldn’t have the same color. What maximum number t of tables can be decorated if we know number of balloons of each color?

Your task is to write a program that for given values r, g and b will find the maximum number t of tables, that can be decorated in the required manner.

Input

The single line contains three integers r, g and b (0 ≤ r, g, b ≤ 2·109) — the number of red, green and blue baloons respectively. The numbers are separated by exactly one space.

Output

Print a single integer t — the maximum number of tables that can be decorated in the required manner.

Sample test(s)
input

output

input

output

input

output

Note

In the first sample you can decorate the tables with the following balloon sets: “rgg”, “gbb”, “brr”, “rrg”, where “r”, “g” and “b” represent the red, green and blue balls, respectively.

题解

此题乱搞的话很容易FST

赛后对着数据乱搞才过的。。。

http://blog.csdn.net/caduca/article/details/40183233

当最大的气球数量的一半小于另外两种颜色的数量之和,可以组成全部颜色数量之和/3,否则全部组成为2+1,2为最多数量的颜色