C. Table Decorations
1 second
256 megabytes
standard input
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 r, g and b will
find the maximum number t of tables, that can be decorated in the required manner.
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.
Print a single integer t — the maximum number of tables that can be decorated in the required manner.
5 4 3
4
1 1 1
1
2 3 3
2
这题一开始以为是模拟题,模拟了很久发现非常麻烦,后来看了代码,发现只要两个算式就行了。1、如果较小的两个数的和的两倍比第三个数小,那么直接输出这两个数的和,否则输出三个数的平均数。
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
__int64 a[10];
__int64 n,m,i,j;
while(scanf("%I64d%I64d%I64d",&a[0],&a[1],&a[2])!=EOF)
{
sort(a,a+3);
if((a[0]+a[1])*2<=a[2]){
printf("%I64d\n",a[0]+a[1]);continue;
}
else printf("%I64d\n",(a[1]+a[2]+a[0])/3);
}
return 0;
}
最新文章
- 【bzoj1076】[SCOI2008]奖励关
- zookeeper+jstorm的集群搭建
- PHP入门二【PHP include 和 require的区别】
- hostapd与wpa_supplicant
- 数组中第K小的数字(Google面试题)
- 搭建java环境
- IE6、7绝对定位层被遮挡的原因(主要是父层决定的)
- C library function - tmpfile()
- PHP 统计中文字符串的长度
- Python PIL库之Image注解(API)
- [计算机组成原理][实验十.R-I-J型指令CPU设计实验总结]
- Dapper 基础用法
- Android permission 访问权限
- mysql 免安装版 启动服务马上关闭
- 【Java虚拟机】浅谈Java虚拟机
- C# Asp.net中xml串与对象互相转换
- Baseline
- P2272 [ZJOI2007]最大半连通子图
- Local policy - User rights assignment 对照表
- [svc]Linux中Swap与Memory内存简单介绍