对map容器的理解

B. Businessmen Problems

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.

In order to avoid this representatives of both companies decided to make an agreement on the sets the companies should present. The sets should be chosen in the way that maximizes the total income of the companies.

All elements are enumerated with integers. The ChemForces company has discovered $n$ distinct chemical elements with indices $a_1,a_2,\dots ,a_n$, and will get an income of $x_i$ Berland rubles if the $i$-th element from this list is in the set of this company.

The TopChemist company discovered $m$ distinct chemical elements with indices $b_1,b_2,\dots ,b_m$, and it will get an income of $y_j$ Berland rubles for including the $j$-th element from this list to its set.

In other words, the first company can present any subset of elements from $\{a_1,a_2,\dots ,a_n\}$ (possibly empty subset), the second company can present any subset of elements from $\{b_1,b_2,\dots ,b_m\}$ (possibly empty subset). There shouldn't be equal elements in the subsets.

Help the representatives select the sets in such a way that no element is presented in both sets and the total income is the maximum possible.

Input

The first line contains a single integer $n$ ($1\le n\le {10}^5$)  — the number of elements discovered by ChemForces.

The $i$-th of the next $n$ lines contains two integers $a_i$ and $x_i$ ($1\le a_i\le {10}^9$, $1\le x_i\le {10}^9$)  — the index of the $i$-th element and the income of its usage on the exhibition. It is guaranteed that all $a_i$ are distinct.

The next line contains a single integer $m$ ($1\le m\le {10}^5$)  — the number of chemicals invented by TopChemist.

The $j$-th of the next $m$ lines contains two integers $b_j$ and $y_j$, ($1\le b_j\le {10}^9$, $1\le y_j\le {10}^9$)  — the index of the $j$-th element and the income of its usage on the exhibition. It is guaranteed that all $b_j$ are distinct.

Output

Print the maximum total income you can obtain by choosing the sets for both companies in such a way that no element is presented in both sets.

Examples

input

Copy

3
1 2
7 2
3 10
4
1 4
2 4
3 4
4 4

output

Copy

24

input

Copy

1
1000000000 239
3
14 15
92 65
35 89

output

Copy

408

Note

In the first example ChemForces can choose the set ($3,7$), while TopChemist can choose ($1,2,4$). This way the total income is $(10+2)+(4+4+4)=24$.

In the second example ChemForces can choose the only element ${10}^9$, while TopChemist can choose ($14,92,35$). This way the total income is $\left(239\right)+(15+65+89)=408$

题意：输入两组数据，每组数据第一个是序号，第二个是收入，相同序号.取最大，输出全部收入

#include <cstdio>
#include <map>
using namespace std;
map<int,int>sum;//考对map容器的使用
int a[2];
int main()
{
    long long ans=0;
    int x,y;
    for(int i=0;i<2;i++)
    {
        scanf("%d",&a[i]);
        for(int j=0;j<a[i];j++)
        {
            scanf("%d%d",&x,&y);
            ans-=sum[x];//减去相同的如1 4 与1 4
            ans+=max(y,sum[x]);
            sum[x]=y;
        }
    }
    printf("%lld\n",ans);
    return 0;
}