Codeforces Round #273 (Div. 2) —— C

C. Table Decorations

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

5 4 3

output

4

input

1 1 1

output

1

input

2 3 3

output

2

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.

题意：

分别给你3种颜色的气球个数，现在用它们装饰一些桌子，每张桌子可以挂3个气球，且这3个气球颜色不能完全一样，问你最多能挂几张桌子？

分析：不知怎么就乱搞出来了。。（当然要分析很多组样例。。）

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
    long long a[3], x;

    for(int i=0; i<3; i++)
        scanf("%lld", a+i);
    sort(a,a+3);
    if(a[2] > (a[0]+a[1])*2) x = a[0]+a[1];
    else x = (a[0]+a[1]+a[2])/3;
    printf("%lld\n", x);
    return 0;
}