zoukankan      html  css  js  c++  java
  • CodeForces1000A- Codehorses T-shirts

    A. Codehorses T-shirts
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Codehorses has just hosted the second Codehorses Cup. This year, the same as the previous one, organizers are giving T-shirts for the winners.

    The valid sizes of T-shirts are either "M" or from 00 to 33 "X" followed by "S" or "L". For example, sizes "M""XXS""L""XXXL" are valid and "XM""Z""XXXXL" are not.

    There are nn winners to the cup for both the previous year and the current year. Ksenia has a list with the T-shirt sizes printed for the last year cup and is yet to send the new list to the printing office.

    Organizers want to distribute the prizes as soon as possible, so now Ksenia is required not to write the whole list from the scratch but just make some changes to the list of the previous year. In one second she can choose arbitrary position in any word and replace its character with some uppercase Latin letter. Ksenia can't remove or add letters in any of the words.

    What is the minimal number of seconds Ksenia is required to spend to change the last year list to the current one?

    The lists are unordered. That means, two lists are considered equal if and only if the number of occurrences of any string is the same in both lists.

    Input

    The first line contains one integer nn (1n1001≤n≤100) — the number of T-shirts.

    The ii-th of the next nn lines contains aiai — the size of the ii-th T-shirt of the list for the previous year.

    The ii-th of the next nn lines contains bibi — the size of the ii-th T-shirt of the list for the current year.

    It is guaranteed that all the sizes in the input are valid. It is also guaranteed that Ksenia can produce list bb from the list aa.

    Output

    Print the minimal number of seconds Ksenia is required to spend to change the last year list to the current one. If the lists are already equal, print 0.

    Examples
    input
    Copy
    3
    XS
    XS
    M
    XL
    S
    XS
    
    output
    Copy
    2
    
    input
    Copy
    2
    XXXL
    XXL
    XXL
    XXXS
    
    output
    Copy
    1
    
    input
    Copy
    2
    M
    XS
    XS
    M
    
    output
    Copy
    0
    
    Note

    In the first example Ksenia can replace "M" with "S" and "S" in one of the occurrences of "XS" with "L".

    In the second example Ksenia should replace "L" in "XXXL" with "S".

    In the third example lists are equal.

    简单的STL使用

    AC代码为:

    #include<bits/stdc++.h>
    using namespace std;
    map<string,int> mp;
    int main()
    {
        ios::sync_with_stdio(false);
        cin.tie(0);
        int n,sum=0;
        string s;
        cin>>n;
        for(int i=1;i<=n;i++) cin>>s,mp[s]++;
        for(int i=1;i<=n;i++) 
        {
            cin>>s;
            if(mp[s]) mp[s]--;
            else sum++;
        }
        cout<<sum<<endl;
        return 0;
    }




  • 相关阅读:
    FW: MBA的学费一般在多少?学MBA有啥用?
    【悟】资本思维:这才是真正"赚大钱的逻辑"
    关于印发《北京市引进人才管理办法(试行)》的通知
    基于wordpress电商解决方案 + POS在线轻量级系统
    SAP Fasion FMS solution 时尚商品行业解决方案
    SAP IS-Retail Promotion and POS Bonus Buy integration
    SAP CARR for retails solution SAP零售集成方案
    Forest-一款比httpClient,okhttp更优雅人性化的http请求组件
    IDEA 日志插件 MyBatis Log Plugin 在线格式化日志工具
    Jenkins ERROR: Server rejected the 1 private key(s)
  • 原文地址:https://www.cnblogs.com/csushl/p/9386533.html
Copyright © 2011-2022 走看看