codeforces #322 div 2 A. Vasya the Hipster(随便搞)-白红宇

codeforces #322 div 2 A. Vasya the Hipster(随便搞)

阅读量：5038 次

发布时间：2019-06-12

本文共 2525 字，大约阅读时间需要 8 分钟。

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 test(s)

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.

实在没有可以解释的...

1 /************************************************************************* 2     > File Name: code/cf/#322/A.cpp 3     > Author: 111qqz 4     > Email: rkz2013@126.com  5     > Created Time: 2015年09月29日 星期二 00时14分24秒 6  ************************************************************************/ 7  8 #include
           
             9 #include
            
             10 #include
             
              11 #include
              
               12 #include
               
                13 #include
                
                 14 #include
                 
                  15 #include
                  16 #include
                   
                    17 #include
                    
                     18 #include
                     
                      19 #include
                      
                       20 #include
                       
                        21 #define y1 hust111qqz22 #define yn hez111qqz23 #define j1 cute111qqz24 #define ms(a,x) memset(a,x,sizeof(a))25 #define lr dying111qqz26 using namespace std;27 #define For(i, n) for (int i=0;i
                        
                         >a>>b;38 int tmp = min(a,b);39 cout<
                         
                          <<" ";40 if (a>b)41 {42 cout<<(a-b)/2<

View Code

转载于:https://www.cnblogs.com/111qqz/p/4845375.html

你可能感兴趣的文章