CCF CSP202006-2稀疏向量
#include<iostream>
#include<map>
using namespace std;
map<int,int>mp;
int main(){
int n,m1,m2;
long long ans = 0;
cin>>n>>m1>>m2;
for(int i = 0; i < m1; i++){
int num1,num2;
cin>>num1>>num2;
mp[num1] = num2;
}
for(int i = 0; i < m2; i++){
int num1,num2;
cin>>num1>>num2;
ans += mp[num1] * num2;
}
cout<<ans<<endl;
cin>>n;
}
//
//10 3 4
//4 5
//7 -3
//10 1
//1 10
//4 20
//5 30
//7 40