Tulostaulu

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
// chmod u+x b.sh
void solve(); int main() {
    ios_base::sync_with_stdio(0); cout.tie(0);
    solve();
}

ll t[110][20];
ll last[110];
ll sum[110];

void solve()
{
    int n, m, k;
    cin >> n >> m >> k;
    map<string, int> p;
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        p.insert({s, i});
    }
    for (int i = 0; i < m; i++) {
        string s;
        cin >> s;
        char a;
        cin >> a;
        ll tulos;
        cin >> tulos;
        if (t[p[s]][a - 'A'] < tulos) {
            last[p[s]] = i;
        }
        t[p[s]][a - 'A'] = max(t[p[s]][a - 'A'], tulos);
    }

    multimap<pair<ll, int>, string, greater<>> ans;
    for (auto [name, ind] : p) {
        for (int k = 0; k < 10; k++) {
            sum[ind] += t[ind][k];
        }
        ans.insert({{sum[ind], -last[ind]}, name});
    }
    for (auto [tulos, peop] : ans) {
        cout << peop << " " << tulos.first << "\n";
    }
    
}

Test 1

Group: 1, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 3

Verdict: ACCEPTED

Test 6

Group: 3

Verdict: ACCEPTED