CCF202006-2稀疏向量

#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int,int> a1,pair<int,int>a2)
{
	return a1.first<a2.first;
}
int main()
{
	int n,a,b;
	long long ans=0;
	vector<pair<int,int> > u,v;
	cin>>n>>a>>b;
	for(int i=0;i<a;i++)
	{
		int tmp1,tmp2;
		cin>>tmp1>>tmp2;
		u.push_back({tmp1,tmp2}); //注意
	}
	for(int i=0;i<b;i++)
	{
		int tmp1,tmp2;
		cin>>tmp1>>tmp2;
		v.push_back({tmp1,tmp2}); 
	}
	sort(u.begin(),u.end(),cmp);
	sort(u.begin(),u.end(),cmp);
	int i=0,j=0;
	while(i<a&&j<b)
	{
		if(u[i].first==v[j].first)
		{
			ans+=u[i].second*v[j].second;
			i++;
			j++;
		}
		else if(u[i].first<v[j].first)
		{
			i++;
		}
		else
		{
			j++;
		}
	}
	cout<<ans;
}