cf478C Table Decorations

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.

这题被搞惨了……各种乱搞都不对啊

orz hzwer

如果最大的气球比另外两种的气球数量之和小，就可以直接组成sum/3个

否则全部都是2:1的方案

 #include <stdio.h>
 #include <iostream>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 using namespace std;
 long long i,j,t,n,m,l,r,k,z,y,x;
 long long g,b,ans;
 int main()
 {
      scanf("%I64d%I64d%I64d",&r,&g,&b);
      ans=min(min(min((r+g+b)/,r+g),r+b),b+g);
      printf("%I64d\n",ans);
      return ;
 }  

cf478C