Codeforces Round #401 (Div. 2) B. Game of Credit Cards（模拟）

B. Game of Credit Cards
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 n-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 = 3, Sherlock’s card is 123 and Moriarty’s card has number 321, first Sherlock names 1 and Moriarty names 3 so Sherlock gets a flick. Then they both digit 2 so no one gets a flick. Finally, Sherlock names 3, while Moriarty names 1 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 1, 2, 3 and get no flicks at all, or he can name 2, 3 and 1 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.

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

The second line contains n digits — Sherlock’s credit card number.

The third line contains n digits — Moriarty’s credit card number.

Output
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.

Examples
input
3
123
321
output
0
2
input
2
88
00
output
2
0
Note
First sample is elaborated in the problem statement. In the second sample, there is no way Moriarty can avoid getting two flicks.

题意：给出N代表接着两行每行给出一个N位的数字，第二行属于S先生，第三行属于M先生。
定义如下打豆豆的规则：对于两个数字，从左往右逐位比较，数字较小的一方会被打一次豆豆，数字较大的一方会获得一次打豆豆的机会，数字相等的话什么也不发生。
神奇的是M先生可以任意改变属于他自己的N位数中任意一位的位置，从而达到不可告人的目的。
求出M先生被打豆豆的最小值和S先生被打豆豆的最大值。

代码

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
using namespace std;
const int maxn=1005;
int main()
{
    int N;
    scanf("%d",&N);
    char str_S[maxn];
    char str_M[maxn];
    memset(str_S,'\0',sizeof(str_S));
    memset(str_M,'\0',sizeof(str_M));
    scanf("%s",str_S);
    scanf("%s",str_M);
    int num_S[10]={0};
    int num_M[10]={0};
    for(int i=0;i<N;i++)
    {
        num_S[str_S[i]-'0']++;
        num_M[str_M[i]-'0']++;
    }
    int min_M=0;
    for(int i=0;i<=9;i++)
    {
        if(num_M[i]>0)
        {
            for(int j=i;j>=0&&num_M[i]>0;)
            {
                if(num_S[j]==0)//对于任意一个i，找到小于等于i的数字
                    j--;
                else
                {
                    min_M++;//这个数不用担心被打
                    num_M[i]--;
                    num_S[j]--;
                }
            }
        }
    }
    min_M=N-min_M;

    memset(num_S,0,sizeof(num_S));
    memset(num_M,0,sizeof(num_M));
    for(int i=0;i<N;i++)
    {
        num_S[str_S[i]-'0']++;
        num_M[str_M[i]-'0']++;
    }
    int max_S=0;
    for(int i=0;i<=9;i++)//对于任意一个i，找到大于i的数字
    {
        if(num_S[i]>0)
        {
            for(int j=i+1;j<=9&&num_S[i]>0;)
            {
                if(num_M[j]==0)
                    j++;
                else
                {
                    max_S++;
                    num_S[i]--;
                    num_M[j]--;
                }
            }
        }
    }
    cout<<min_M<<endl<<max_S<<endl;
    return 0;
}