[Codeforces478C] Table Decorations

描述 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.

输入格式 InputFormat

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.

输出格式 OutputFormat

Print a single integer t — the maximum number of tables that can be decorated in the required manner.

样例输入 SampleInput

1234567890 123456789 987654321

样例输出 SampleOutput

781893000

Codeforces 478C

代码 Code

理想情况是三种气球数量都相等，否则就是数量最多的气球取出两个与其他两种颜色结合。于是取个最小值就好了。

#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)/3,r+g),r+b),b+g);
     printf("%I64d\n",ans);
     return 0;
}