zoukankan      html  css  js  c++  java
  • 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
    Copy
    3
    123
    321
    output
    Copy
    0
    2
    input
    Copy
    2
    88
    00
    output
    Copy
    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.


    刚开始以为是说田忌赛马福尔摩斯版,实际上有一点不一样,读题很重要。

    #include <iostream>
    #include <vector>
    #include <algorithm>
    #include <string>
    #include <set>
    #include <queue>
    #include <map>
    #include <sstream>
    #include <cstdio>
    #include <cstring>
    #include <numeric>
    #include <cmath>
    #include <unordered_set>
    #include <unordered_map>
    #include <xfunctional>
    #define ll long long
    #define mod 998244353
    using namespace std;
    int dir[4][2] = { {0,1},{0,-1},{-1,0},{1,0} };
    const int maxn = 1e5 + 5;
    const long long inf = 0x7f7f7f7f7f7f7f7f;
    
    int main()
    {
        int n, sf = 0, mf = 0;
        cin >> n;
        string s, m;
        cin >> s;
        cin >> m;
        vector<int> sn, mn;
        for (int i = 0; i < s.size(); i++)
        {
            sn.push_back(s[i] - '0');
            mn.push_back(m[i] - '0');
        }
        sort(mn.begin(), mn.end());
        for (int i = 0; i < s.size(); i++)
        {
            vector<int>::iterator iter;
            iter = lower_bound(mn.begin(), mn.end(), sn[i]);
            if (iter == mn.end())
            {
                sf++;
            }
            else
                mn.erase(iter);
        }
        mn.clear();
        for (int i = 0; i < s.size(); i++)
        {
            mn.push_back(m[i] - '0');
        }
        sort(mn.begin(), mn.end());
        for (int i = 0; i < s.size(); i++)
        {
            vector<int>::iterator iter;
            iter = upper_bound(mn.begin(), mn.end(), sn[i]);
            if (iter != mn.end())
            {
                mn.erase(iter);
                mf++;
            }
        }
        cout << sf << endl;
        cout << mf << endl;
        return 0;
    }
  • 相关阅读:
    facade 对于有很多接口的提供一个简单的接口
    UML 常用符号 转
    <html> 按钮换行
    javascript: change the content of table
    [转载]当今计算机软件开发和应用领域最重要十种关键技术
    括号匹配算法
    求出给定两日期段 之间的交集算法
    表中的数据导出为insert语句的简单方法
    投色子下注的小程序
    未来社会发展趋势__P2p时代
  • 原文地址:https://www.cnblogs.com/dealer/p/12346404.html
Copyright © 2011-2022 走看看