Tulostaulu

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
 
typedef tree<int,null_type,less<>,rb_tree_tag,tree_order_statistics_node_update> index_set;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
 
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define FOR(i,a,b) for (int i = a; i < b; i++)
 
constexpr ll MOD = 1000000007;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n, m, k; cin >> n >> m >> k;
    map<string, map<char, int>> pta;
    map<string, int> pto, ft;
    FOR(i,0,n) {
        string x; cin >> x;
        pto[x] = 0;
    }
    FOR(i,0,m) {
        string a; cin >> a;
        char b; cin >> b;
        int c; cin >> c;
        if (c > pta[a][b]) pta[a][b] = c, ft[a] = -i;
    }
    for (auto i : pta) {
        for (auto j : i.S) {
            pto[i.F] += j.S;
        }
    }
    set<pair<pair<int, int>, string>, greater<>> fs;
    for (auto i : pto) {
        fs.insert({{i.S, ft[i.F]}, i.F});
    }
    vector<string> ze;
    for (auto i : fs) {
        if (i.F.F == 0) ze.PB(i.S);
        else cout << i.S << " " << i.F.F << "\n";
    }
    reverse(ze.begin(), ze.end());
    for (string i : ze) {
        cout << i << " " << 0 << "\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