Tulostaulu

#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    //freopen("test.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    int n, m, k; cin >> n >> m >> k;

    vector<string> names(n);
    map<string, int> b;


    for (int i=0;i<n;i++) {
        cin >> names[i];
    } 

    map<char, int> a;
    vector<char> chars = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};
    for (int i=0;i<k;i++) a[chars[i]] = i;
    for (int i=0;i<n;i++) {
        b[names[i]] = i;
    } 

    int ans[n][k];

    for (string name : names) {
        for (char c : chars) {
            ans[b[name]][a[c]] = 0;
        }
    }

    for(int i=0;i<m;i++) {
        string name; char task; int score;

        cin >> name >> task >> score;

        if (ans[b[name]][a[task]] != 0) {
            ans[b[name]][a[task]] = max(ans[b[name]][a[task]], score);
        } else if (ans[b[name]][a[task]]==0) {
            ans[b[name]][a[task]] = score;
        } 
    }

    vector<pair<int, string>> pls_toimi;
    for (string name : names) {
        ll tmp = 0;
        for (int i=0;i<k;i++) {
            tmp += ans[b[name]][a[chars[i]]];
        }

        pls_toimi.push_back(make_pair(tmp, name));
        //cout << name << " " << tmp << endl;
    }

    (sort(pls_toimi.begin(), pls_toimi.end()));

    for (int i=n-1;i>=0;i--) {
        cout << pls_toimi[i].second << " " << pls_toimi[i].first << endl; 
    }
    /*for (string name : names) {
        int s = 0;
        for (int i=0;i<k;i++) {
            cout << ans[b[name]][i] << endl;
        }
    }*/

}

Test 1

Group: 1, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 3

Verdict: WRONG ANSWER

Test 6

Group: 3

Verdict: WRONG ANSWER