zoukankan      html  css  js  c++  java
  • Codehorses T-shirts (map+遍历)

    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 (1≤n≤1001≤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

    3
    XS
    XS
    M
    XL
    S
    XS
    

    Output

    2
    

    Input

    2
    XXXL
    XXL
    XXL
    XXXS
    

    Output

    1
    

    Input

    2
    M
    XS
    XS
    M
    

    Output

    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.

    题解:题目的意思是找出不一样的换掉,并且换的次数最少

    map+遍历

    代码:

    #include<iostream>
    #include<string>
    #include<algorithm>
    #include<map>
    using namespace std;
    const int N = 105;
    string a[N],b[N];
    map<string,int>A,B;
    int main(){
    	int n;
    	cin>>n;
    	for(int i=0;i<n;i++)
    	   cin>>a[i];
    	for(int i=0;i<n;i++)
    	   cin>>b[i];
    	for(int i=0;i<n;i++){
    		A[a[i]]++;
    		B[b[i]]++;
    	}
    	map<string,int>::iterator it;
    	int ans=n;
    	for(it=A.begin();it!=A.end();it++)
    	   ans-=min(it->second,B[it->first]);
    	cout<<ans<<endl;
    	return 0;
    }
    
  • 相关阅读:
    c++重点笔记2
    c++学习笔记重点1
    创业思路(3) 传统行业与互联网思维
    创业思路(2) 社交
    创业思路(1)
    Asp.Net实现Http长连接推送
    又回来了
    2021.10.23软件更新公告
    2021.10.22软件更新公告
    SharePoint 2013 新特性 (三) 破改式 —— 设计管理器的使用 [2.HTML变身模板页]
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/10781997.html
Copyright © 2011-2022 走看看