• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    公众号

cf478CTableDecorations

原作者: [db:作者] 来自: [db:来源] 收藏 邀请
C. Table Decorations
time limit per test 1 second
memory limit per test 256 megabytes
input standard input
output standard 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 rg 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 rg 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 test(s)
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.

 

这题被搞惨了……各种乱搞都不对啊

orz hzwer

如果最大的气球比另外两种的气球数量之和小,就可以直接组成sum/3个

否则全部都是2:1的方案

 1 #include <stdio.h>  
 2 #include <iostream>  
 3 #include <cstring>  
 4 #include <algorithm>  
 5 #include <cmath>  
 6 using namespace std;  
 7 long long i,j,t,n,m,l,r,k,z,y,x;  
 8 long long g,b,ans;  
 9 int main()  
10 {  
11      scanf("%I64d%I64d%I64d",&r,&g,&b);  
12      ans=min(min(min((r+g+b)/3,r+g),r+b),b+g);  
13      printf("%I64d\n",ans);  
14      return 0;  
15 }  
cf478C

 


鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
C++中public/protect/private三种访问权限控制发布时间:2022-07-13
下一篇:
数据结构期末复习(C++部分)发布时间:2022-07-13
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap