CodeForces - 581A Vasya the Hipster （水）

CodeForces
- 581A
Vasya the Hipster

Time Limit: 1000MS

Memory Limit: 262144KB

64bit IO Format: %I64d & %I64u

Submit Status

Description

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.

Sample Input

Input

3 1

Output

1 1

Input

2 3

Output

2 0

Input

7 3

Output

3 2

Hint

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.

Source
Codeforces Round #322 (Div. 2)
//题意 ：
给出红色袜子有n支，蓝色袜子有m支，问最多可以组成几对红蓝袜子和剩下几对相同的袜子

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
int k=min(n,m);
int kk=(max(n,m)-k)/2;
printf("%d %d\n",k,kk);
}
return 0;
}