CCF 202006-2 稀疏向量 (简单遍历)

传送门

思路：不外乎就是 ，直接暴力写就好啦，主要答案会爆int，不然就只有60%通过率了。

代码实现：

import java.util.*;

public class Main {
    static Map<String, Integer> mpa = new HashMap<String, Integer>();
    static Map<String, Integer> mpb = new HashMap<String, Integer>();
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int a = in.nextInt();
        int b = in.nextInt();
        while(a>0){
            a --;
            String x = in.next();
            int y = in.nextInt();
            mpa.put(x, y);
        }
        while(b>0){
            b --;
            String x = in.next();
            int y = in.nextInt();
            mpb.put(x, y);
        }
        long ans = 0;
        for(String key : mpa.keySet()){
            if(mpa.get(key)!=null && mpb.get(key)!=null) {
                ans += (long)mpa.get(key)*mpb.get(key);
            }
        }
        System.out.println(ans);
        in.close();
    }
}