题库练习 Vasya the Hipster
← 上一题 下一题 →

A10005 | Vasya the Hipster

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

One day Vasya the Hipster decided to count how many socks he had. It turned out that he had $a$ red socks and $b$ blue socks.

According to the latest fashion, hipsters should wear the socks of different colors: a red one on the left foot, a blue one on the right foot.

Every day Vasya puts on new socks in the morning and throws them away before going to bed as he doesn't want to wash them.

Vasya wonders, what is the maximum number of days when he can dress fashionable and wear different socks, and after that, for how many days he can then wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.

Can you help him?

输入格式

The single line of the input contains two positive integers $a$ and $b$ ( $1<=a,b<=100$ ) — the number of red and blue socks that Vasya's got.

输出格式

Print two space-separated integers — the maximum number of days when Vasya can wear different socks and the number of days when he can wear the same socks until he either runs out of socks or cannot make a single pair from the socks he's got.

Keep in mind that at the end of the day Vasya throws away the socks that he's been wearing on that day.

输入输出样例

输入 #1
3 1
输出 #1
1 1
输入 #2
2 3
输出 #2
2 0
输入 #3
7 3
输出 #3
3 2
C++ 编辑器
输入
输出