logo AlgoBeat OnlineJudge
登录 注册

#215196. [UOI 2023 II Stage] Gallery

内存限制:512 MiB 时间限制:1000 ms 标准输入输出
题目类型:VJudge(洛谷) 评测方式:VJudge
上传者: 匿名

题目描述

Cossack Vus works in a gallery, and he was given the task of building the highest tower of vases possible.

He has three vases with heights , , . However, unfortunately, if three vases are placed on top of each other, the structure will quickly break. Cossack can only choose two vases and place them on top of each other. He wants to get the highest composition of vases.

Find the maximum height he can reach.

输入格式

The first line contains three integers , , ().

输出格式

Output the maximum height of the composition that satisfies the condition.

样例

样例输入 1

7 4 3

样例输出 1

11

样例输入 2

2 2 6

样例输出 2

8

数据范围与提示

In the first example, we can take the first and second vases. The height of the composition will be .

In the second example, we can take the second and third vases. The height of the composition will be . You can also take the first vase instead of the second.