【练习记录】202006-2 稀疏向量

202006-2 稀疏向量

Tips：记得用long long
思路:HashMap

#include<iostream>
#include<map>
using namespace std;
int n, n1, n2;	
int main()
{
	long long a, b, sum = 0;
	map<int, int> u;
	cin >> n >> n1 >> n2;
	while (n1--) {
		cin >> a >> b;
		u[a] = b;
	}
	while (n2--) {
		cin >> a >> b;
		map<int, int>::iterator iter = u.find(a);
		if (iter != u.end()) { //find
			sum += b * u[a];
		}
	}
	cout << sum;
	return 0;
}