Table Decorations（贪心）

原题链接

C. Table Decorations
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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.

Examples
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那么决定最后能装饰多少个桌子就是由另外两个桌子的和来决定的，否则就是由三个数最后取的平均数来决定的

#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
long long a[3];
int main(){
        cin >> a[0] >> a[1] >> a[2];
        sort(a,a+3);
        if((a[0]+a[1])*2 < a[2]){
                cout << a[0]+a[1];
                return 0;
        }
        else cout << (a[0]+a[1]+a[2])/3;
        return 0;
}

也有另外一个方法

#include <cstdio>
#include <algorithm>
using namespace std;
long long a[4];
int main(){
        long long r,g,b;
        scanf("%lld%lld%lld",&r,&g,&b);
        a[0] = (r+g+b)/3;
        a[1]=r + g;a[2]= r + b;a[3]= b + g;
        long long mixn = 1e11;
        for(int i=0;i<4;i++)
                mixn = min(mixn,a[i]);
        printf("%d\n",mixn);
        return 0;
}