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·109) — 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.
5 4 3
4
1 1 1
1
2 3 3
2
int main()
{
__int64 r,g,b,ans;
scanf("%I64d%I64d%I64d",&r,&g,&b);
ans=(r+g+b)/3;
ans=ans<r+g?ans:r+g;//方法一
ans=ans<b+g?ans:b+g;
ans=ans<r+b?ans:r+b;
pf("%I64d",ans);
if (a<b) swap(a,b);//方法二
if (b<c) swap(b,c);
if (a<b) swap(a,b);
if (a>=2*b+2*c) cout<<b+c;
else cout<<(a+b+c)/3;
}