Codeforces Round #273 (Div. 2)-C. Table Decorations

http://codeforces.com/contest/478/problem/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.

解题思路：贪心， 两个较小的两倍若比最大的那个小，这输出2个较小的和，否则输出3个的和的三分之一

1 #include <stdio.h>

 2 
 3 int main(){
 4     long long r, g, b, ma, mi, mid, sum;
 5     while(scanf("%I64d %I64d %I64d", &r, &g, &b) != EOF){
 6         ma = mi = mid = r;
 7         sum = r + g + b;
 8         ma = ma > g ? ma : g;
 9         ma = ma > b ? ma : b;
         mi = mi < g ? mi : g;
         mi = mi < b ? mi : b;
         mid = sum - ma - mi;
         if(ma >  * (mid + mi)){
             printf("%I64d\n", sum - ma);
         }
         else{
             printf("%I64d\n", sum / );
         }
     }
     return ;
 }