文章目录
一、 Vasya the Hipster
总结
一、 Vasya the Hipster
本题链接：Vasya the Hipster
题目：
A. Vasya the Hipster
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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?
Input
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.
Output
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.
Examples
input
3 1
output
1 1
input
2 3
output
2 0
input
7 3
output
3 2
Note
In the first sample Vasya can first put on one pair of different socks, after that he has two red socks left to wear on the second day.
本博客给出本题截图：
题意：给出两个不同颜色袜子的个数，每天穿一双之后扔掉这一双，优先穿两种不同颜色的袜子，穿完之后穿同色的袜子，问两种不同穿法的天数分别是多少
AC代码
#include <iostream> #include <algorithm> using namespace std; int main() { int a, b; cin >> a >> b; cout << min(a, b) << ' ' << (max(a, b) - min(a, b)) / 2; return 0; }
总结
水题，不解释
