描述
题解
一个 map m a p 即可,同一个 key k e y 取价高即可,最后遍历求和。
代码
#include <iostream>
#include <map>
using namespace std;
int n, m, x, y;
map<int, int> mii;
int main(int argc, const char * argv[])
{
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> x >> y;
if (mii[x] < y)
{
mii[x] = y;
}
}
cin >> m;
for (int i = 0; i < m; i++)
{
cin >> x >> y;
if (mii[x] < y)
{
mii[x] = y;
}
}
long long sum = 0;
for (auto it : mii)
{
sum += it.second;
}
cout << sum << '\n';
return 0;
}