Table Decorations(思维题)

最新推荐文章于 2019-03-08 13:03:33 发布

yutianhuan

最新推荐文章于 2019-03-08 13:03:33 发布

阅读量866

点赞数 2

CC 4.0 BY-SA版权

分类专栏： acm

本文链接：https://blog.youkuaiyun.com/yutianhuan/article/details/52090612

给定不同颜色的气球，每桌需要三种不同颜色的气球进行装饰，确保每桌气球颜色不重复。要求计算能装饰的最大桌子数量。输入包含每种颜色气球的数目，输出是最大装饰桌子数。示例和解题思路说明了如何确定能装饰的桌子数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

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 Input
Input
5 4 3
O