稀疏向量(svector)
#include<iostream>
using namespace std;
#include<vector>
const int N=1e6;
struct shuzu
{
int u;
int v;
}A[N],B[N];
int main()
{
int n, a, b;
int sult = 0;
cin >> n >> a >> b;
vector<int> a1(n, 0);
vector<int> b1(n, 0);
for (int i = 0; i < a; i++)
{
cin >> A[i].u >> A[i].v;
a1[A[i].u-1] = A[i].v;
}
for (int i = 0; i < b; i++)
{
cin >> B[i].u >> B[i].v;
b1[B[i].u-1] = B[i].v;
}
for (int i = 0; i < n; i++)
sult=sult+a1[i]*b1[i];
cout << sult;
return 0;
}