CF478C.Table Decorations

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

The single line contains three integers $r$ , $g$ and $b$ ( $0<=r,g,b<=2·10^{9}$ ) — the number of red, green and blue baloons respectively. The numbers are separated by exactly one space.

输出格式

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

输入输出样例

输入#1
```
5 4 3
```
输出#1
```
4
```
输入#2
```
1 1 1
```
输出#2
```
1
```
输入#3
```
2 3 3
```
输出#3
```
2
```

说明/提示

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.

首页