zoj2019.cpp

最近在acm.zju.edu.cn上通过的题目的代码

#include <algorithm>
#include <map>
using namespace std;

map<int, int> a, b;
int n, m;

int main(){
    int t;
    while (EOF != scanf("%d %d", &n, &m)){
        a.clear();  b.clear();
        for (int i = 0; i < n; i++) {
            scanf("%d", &t);
            a[t]++;
        }
        for (int i = 0; i < m; i++) {
            scanf("%d", &t);
            b[t]++;
        }
        int ans = 0;
        for (map<int, int>::iterator it = a.begin(); it != a.end(); it++){
            ans += min((*it).second, b[(*it).first]);
        }
        printf("%d\n", ans);
    }
    return 0;   
}