A - Table Decorations codeforces 487C

来源:互联网 发布:c语言写图书管理系统 编辑:程序博客网 时间:2024/05/23 12:29

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.

#include <iostream>#include <cstdio>#include <algorithm>using namespace std;long long c[3];int main(){    scanf("%I64d%I64d%I64d", &c[0], &c[1], &c[2]);    int t = 0;    sort( c, c + 3);    if( c[0]*2 + c[1]*2 <= c[2])        t = (c[0]+c[1]);    else        t = (c[0] + c[1] + c[2])/3;    cout << t << endl;    return 0;}

测试数据 来源 codeforces

Test: #1, time: 0 ms., memory: 2040 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
5 4 3

Output
4

Answer
4

Checker Log
ok 1 number(s): “4”

Test: #2, time: 0 ms., memory: 2028 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
1 1 1

Output
1

Answer
1

Checker Log
ok 1 number(s): “1”

Test: #3, time: 0 ms., memory: 2032 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
2 3 3

Output
2

Answer
2

Checker Log
ok 1 number(s): “2”

Test: #4, time: 15 ms., memory: 2036 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
0 1 0

Output
0

Answer
0

Checker Log
ok 1 number(s): “0”

Test: #5, time: 0 ms., memory: 2036 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
0 3 3

Output
2

Answer
2

Checker Log
ok 1 number(s): “2”

Test: #6, time: 0 ms., memory: 2028 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
4 0 4

Output
2

Answer
2

Checker Log
ok 1 number(s): “2”

Test: #7, time: 15 ms., memory: 2028 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
1000000000 1000000000 1000000000

Output
1000000000

Answer
1000000000

Checker Log
ok 1 number(s): “1000000000”

Test: #8, time: 15 ms., memory: 2020 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
100 99 56

Output
85

Answer
85

Checker Log
ok 1 number(s): “85”

Test: #9, time: 15 ms., memory: 2028 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
1000 1000 1002

Output
1000

Answer
1000

Checker Log
ok 1 number(s): “1000”

Test: #10, time: 0 ms., memory: 2040 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
0 1 1000000000

Output
1

Answer
1

Checker Log
ok 1 number(s): “1”

Test: #11, time: 0 ms., memory: 2036 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
500000000 1000000000 500000000

Output
666666666

Answer
666666666

Checker Log
ok 1 number(s): “666666666”

Test: #12, time: 0 ms., memory: 2024 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
1000000000 2000000000 1000000000

Output
1333333333

Answer
1333333333

Checker Log
ok 1 number(s): “1333333333”

Test: #13, time: 0 ms., memory: 2036 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
2000000000 2000000000 2000000000

Output
2000000000

Answer
2000000000

Checker Log
ok 1 number(s): “2000000000”

Test: #14, time: 0 ms., memory: 2040 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
0 0 0

Output
0

Answer
0

Checker Log
ok 1 number(s): “0”

Test: #15, time: 15 ms., memory: 2032 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
1 2000000000 1000000000

Output
1000000000

Answer
1000000000

Checker Log
ok 1 number(s): “1000000000”

Test: #16, time: 0 ms., memory: 2036 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
1585222789 1889821127 2000000000

Output
1825014638

Answer
1825014638

Checker Log
ok 1 number(s): “1825014638”

Test: #17, time: 0 ms., memory: 2008 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
10000 7500 7500

Output
8333

Answer
8333

Checker Log
ok 1 number(s): “8333”

Test: #18, time: 0 ms., memory: 2024 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
150000 75000 75000

Output
100000

Answer
100000

Checker Log
ok 1 number(s): “100000”

Test: #19, time: 15 ms., memory: 2024 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
999288131 55884921 109298382

Output
165183303

Answer
165183303

Checker Log
ok 1 number(s): “165183303”

Test: #20, time: 0 ms., memory: 2028 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
100500 100500 3

Output
67001

Answer
67001

Checker Log
ok 1 number(s): “67001”

Test: #21, time: 0 ms., memory: 2040 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
1463615122 1988383731 837331500

Output
1429776784

Answer
1429776784

Checker Log
ok 1 number(s): “1429776784”

Test: #22, time: 0 ms., memory: 2028 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
1938 8999 1882

Output
3820

Answer
3820

Checker Log
ok 1 number(s): “3820”

Test: #23, time: 15 ms., memory: 2020 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
45 33 76

Output
51

Answer
51

Checker Log
ok 1 number(s): “51”

Test: #24, time: 0 ms., memory: 2036 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
100000 1 2

Output
3

Answer
3

Checker Log
ok 1 number(s): “3”

Test: #25, time: 15 ms., memory: 2032 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
198488 50 18

Output
68

Answer
68

Checker Log
ok 1 number(s): “68”

Test: #26, time: 0 ms., memory: 2020 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
82728372 939848 100139442

Output
61269220

Answer
61269220

Checker Log
ok 1 number(s): “61269220”

Test: #27, time: 0 ms., memory: 2032 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
99 5747 5298

Output
3714

Answer
3714

Checker Log
ok 1 number(s): “3714”

Test: #28, time: 0 ms., memory: 2036 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
3 5 2

Output
3

Answer
3

Checker Log
ok 1 number(s): “3”

Test: #29, time: 0 ms., memory: 2040 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
7511 7512 7513

Output
7512

Answer
7512

Checker Log
ok 1 number(s): “7512”

Test: #30, time: 0 ms., memory: 2032 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
1234567890 123456789 987654321

Output
781893000

Answer
781893000

Checker Log
ok 1 number(s): “781893000”

Test: #31, time: 0 ms., memory: 2036 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
500000000 2000000000 500000000

Output
1000000000

Answer
1000000000

Checker Log
ok 1 number(s): “1000000000”

Test: #32, time: 0 ms., memory: 2012 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
500000002 2000000000 500000001

Output
1000000001

Answer
1000000001

Checker Log
ok 1 number(s): “1000000001”

Test: #33, time: 0 ms., memory: 2024 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
520000000 1000000033 501000000

Output
673666677

Answer
673666677

Checker Log
ok 1 number(s): “673666677”

Test: #34, time: 0 ms., memory: 2024 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
10000 1000 100000

Output
11000

Answer
11000

Checker Log
ok 1 number(s): “11000”

Test: #35, time: 15 ms., memory: 2036 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
2000000000 500000000 499999999

Output
999999999

Answer
999999999

Checker Log
ok 1 number(s): “999999999”

Test: #36, time: 31 ms., memory: 2040 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
1999999999 500000000 500000000

Output
999999999

Answer
999999999

Checker Log
ok 1 number(s): “999999999”

Test: #37, time: 15 ms., memory: 2024 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
1 1 9

Output
2

Answer
2

Checker Log
ok 1 number(s): “2”

Test: #38, time: 15 ms., memory: 2036 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
3 0 0

Output
0

Answer
0

Checker Log
ok 1 number(s): “0”

Test: #39, time: 0 ms., memory: 2032 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
6 1 1

Output
2

Answer
2

Checker Log
ok 1 number(s): “2”

Test: #40, time: 15 ms., memory: 2024 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
2000000000 1999999999 1999999999

Output
1999999999

Answer
1999999999

Checker Log
ok 1 number(s): “1999999999”

Test: #41, time: 15 ms., memory: 2032 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
3 4 9

Output
5

Answer
5

Checker Log
ok 1 number(s): “5”

Test: #42, time: 0 ms., memory: 2020 KB, exit code: 0, checker exit code: 0, verdict: OK

Input
3 3 6

Output
4

Answer
4

Checker Log
ok 1 number(s): “4”

0 0