C. Table Decorations（Codeforces）(规律)

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.

只要把规律找到，题目就做完了。

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

int main()
{
    __int64 a,b,c;
    while(scanf("%I64d%I64d%I64d",&a,&b,&c)!=EOF)
    {
        __int64 x = a + b + c;
        __int64 y = x/3;
        __int64 z = y;
        if(a>=2*y)
        {
            z = b + c;
        }
        else if(b>=2*y)
        {
            z = a + c;
        }
        else if(c>=2*y)
        {
            z = a + b;
        }
        if(y>=z)
        {
            printf("%I64d\n",z);
        }
        else
        {
            printf("%I64d\n",y);
        }

    }
    return 0;
}