CF777B.Game of Credit Cards

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards.

Rules of this game are simple: each player bring his favourite nn -digit credit card. Then both players name the digits written on their cards one by one. If two digits are not equal, then the player, whose digit is smaller gets a flick (knock in the forehead usually made with a forefinger) from the other player. For example, if n=3n=3 , Sherlock's card is 123123 and Moriarty's card has number 321321 , first Sherlock names 11 and Moriarty names 33 so Sherlock gets a flick. Then they both digit 22 so no one gets a flick. Finally, Sherlock names 33 , while Moriarty names 11 and gets a flick.

Of course, Sherlock will play honestly naming digits one by one in the order they are given, while Moriary, as a true villain, plans to cheat. He is going to name his digits in some other order (however, he is not going to change the overall number of occurences of each digit). For example, in case above Moriarty could name 11 , 22 , 33 and get no flicks at all, or he can name 22 , 33 and 11 to give Sherlock two flicks.

Your goal is to find out the minimum possible number of flicks Moriarty will get (no one likes flicks) and the maximum possible number of flicks Sherlock can get from Moriarty. Note, that these two goals are different and the optimal result may be obtained by using different strategies.

输入格式

The first line of the input contains a single integer nn ( 1<=n<=10001<=n<=1000 ) — the number of digits in the cards Sherlock and Moriarty are going to use.

The second line contains nn digits — Sherlock's credit card number.

The third line contains nn digits — Moriarty's credit card number.

输出格式

First print the minimum possible number of flicks Moriarty will get. Then print the maximum possible number of flicks that Sherlock can get from Moriarty.

输入输出样例

  • 输入#1

    3
    123
    321
    

    输出#1

    0
    2
    
  • 输入#2

    2
    88
    00
    

    输出#2

    2
    0
    

说明/提示

First sample is elaborated in the problem statement. In the second sample, there is no way Moriarty can avoid getting two flicks.

首页