выборы

#include <iostream>
#include <string>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <stdio.h>
#include <stack>
#include <deque>
#include <queue>
#include <vector>
#include <set>
#include <iterator>
#include <map>
#include <iomanip>
#include <unordered_set>
#define int long long
#define sp system("pause")
#define pb push_back
#define double long double
#define endl "\n"
#define un unsigned
#define INF 1000000009
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;

int n1;

istream& operator >> (istream& in, vector<int>& a)
{
    for (int i = 0; i < n1; i++)
    {
        in >> a[i];
    }

    return in;
}

ostream& operator << (ostream& out, vector<char>& a)
{
    for (int i = n1 - 1; i > -1; i--)
    {
        out << a[i];
    }

    return out;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie();
    cout.tie();
    cout.precision(7);

    int n;
    cin >> n;

    map<string, int> mp;

    for (int i = 0; i < n; i++)
    {
        string s;
        int k;
        cin >> s >> k;

        mp[s] = k;
    }

    int m;
    cin >> m;

    map<string, map <string, int>> gol;

    for (int i = 0; i < m; i++)
    {
        string a, b;
        cin >> a >> b;

        gol[a][b]++;
    }

    map<string, int> kon;

    for (auto i : gol)
    {
        int kol = 0;
        string name = "";

        for (pair<string, int> j : i.second)
        {
            if (j.second > kol)
            {
                name = j.first;
                kol = j.second;
            }

            kon[j.first] += 0;
        }

        kon[name] += mp[i.first];
    }

    set<pair<int, string>> ans;

    for (auto i : kon)
    {
        ans.insert({ i.second, i.first });
    }

    auto it = ans.end();
    it--;

    for ( ; it != ans.begin(); it--)
    {
        auto i = *it;

        cout << i.second << " " << i.first << endl;
    }

    cout << (*ans.begin()).second << " " << (*ans.begin()).first;

    return 0;
}