CodeForces 478C Table Decorations

C - Table Decorations

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 478C

Description

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·10⁹) — 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 Input

Input

5 4 3

Output

4

Input

1 1 1

Output

1

Input

2 3 3

Output

2

很容易想到的是3个数的和除以3，但是这里面有不合符条件的情况，那就是选出的3个全是一个颜色的情况这种除非就是这种颜色的个数大于剩下的两个数的和。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iomanip>
using namespace std;



int main()
{

    long long a[3],ans;
    while(~scanf("%I64d%I64d%I64d",&a[0],&a[1],&a[2]))
    {
        sort(a,a+3);
        if(a[2]>=(a[0]+a[1])*2)ans=a[0]+a[1];
        else ans=(a[0]+a[1]+a[2])/3;
        printf("%I64d\n",ans);
    }
    return 0;
}