题目链接：http://codeforces.com/problemset/problem/581/A
581A. Vasya the Hipster
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard 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.
题意：有a,b两种数量的袜子，问两只脚穿不同的袜子的最多天数，以及后面穿相同袜子的天数。
思路：找出a,b最小值，最小的值即为穿不同袜子的最多天数。最大的值减最小的值再除以2即为后面穿相同袜子的天数。
代码
#include<stdio.h>
int main()
{
int a,b;
scanf("%d%d",&a,&b);
if(a>b){
printf("%d %d\n",b,(a-b)/2);
}
else {
printf("%d %d\n",a,(b-a)/2);
}return 0;
}