Tulostaulu

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

int main() {
    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 (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) {
            ans[i][j] = 0;  
        }
    }

    vector<ll> first(n, -1);

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

        int idx = b[name];
        int task_idx = a[task];

        if (score > ans[idx][task_idx]) {
            ans[idx][task_idx] = score;
            if (first[idx] == -1) {
                first[idx] = i;  
            }
        }
    }

    vector<pair<int, pair<int, string>>> score_list;
    for (int i = 0; i < n; i++) {
        ll totalScore = 0;
        for (int j = 0; j < k; j++) {
            totalScore += ans[i][j];
        }
        score_list.push_back({totalScore, {first[i], names[i]}});
    }

  
     sort(score_list.begin(), score_list.end(), [](const auto& a, const auto& b) {
        if (a.first != b.first) {
            return a.first > b.first; 
        } else if (a.second.first != b.second.first) {
            return a.second.first > b.second.first; 
        } else {
            return a.second.second < b.second.second; 
        }
    });

    for (const auto& ans : score_list) {
        cout << ans.second.second << " " << ans.first << endl;
    }

    return 0;
}

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: ACCEPTED

Test 6

Group: 3

Verdict: WRONG ANSWER