zoukankan      html  css  js  c++  java
  • cf478C Table Decorations

    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
    ",ans);  
    14      return 0;  
    15 }  
    cf478C
    ——by zhber,转载请注明来源
  • 相关阅读:
    asp.net获取服务端和客户端信息
    ASP.NET 中JSON 的序列化和反序列化
    Asp.net TextBox常规输入验证
    ADO.NET中的五个主要对象
    .Net一般处理程序来实现用户名的验证
    .net获取当前网址url(各种参数值)
    hdu-1941 Find the Shortest Common Superstring
    字典树的动态与静态模板
    模板 Dijkstra+链式前向星+堆优化(非原创)
    基础深搜小结
  • 原文地址:https://www.cnblogs.com/zhber/p/4055136.html
Copyright © 2011-2022 走看看