Codeforces Round #401 (Div. 2), problem: (B) Game of Credit Cards

                B. Game of Credit Cards

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.

题意：S与M拥有相同书面卡片，按照位置依次比较双方的每一张卡片，若卡片上值 小，将会受到一次嘲讽，求M受到的最小嘲讽数，S受到的最大嘲讽数
（S卡片位置固定，M由于可能作弊，其卡片位置可自行调整已达到目的，因此S和M的卡片可直接按需求排序处理）
思路：
1，M受到的最小嘲讽数 ：尽可能多的让M打平或战胜S，尽可能多的使Vm>=Vs成立
2，S受到的最大嘲讽数：尽可能的使M赢S，Vm>Vs

对M,S卡片分别排序对齐，贪心选择答案

做的时候把输入看反了…..看成先输入M，再S，WA了半年

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int main(){
    int n;
    cin>>n;

    string s,m;
    cin>>s;
    cin>>m;
    int r1,r2;
    r1=r2=0;
    sort(s.begin(),s.end());
    sort(m.begin(),m.end());
    bool f[2000];
    memset(f,0,sizeof(f));
        for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
    if(m[i]>=s[j]&&!f[j])
    {
        r1++;
        f[j]=1;
        break;
    }       
        }
    }

    r1=n-r1;
    memset(f,0,sizeof(f));
        for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
    if(m[i]>s[j]&&!f[j])
    {
        r2++;
        f[j]=1;
        break;
    }       
        }
    }
    cout<<r1<<endl;
    cout<<r2<<endl;
    return 0;
}