Tulostaulu

#include <bits/stdc++.h>

#define newl "\n"

#define pb push_back

using namespace std;

typedef long long ll;

typedef pair<int, int> ip;
typedef pair<ll, ll> lp;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

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

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

    sort(names.rbegin(), names.rend());

    map<string, array<int, 256>> map;

    for (int i = 0; i < m; i++)
    {
        string name; cin >> name;
        char problem; cin >> problem;
        int points; cin >> points;
        int current = map[name][problem];

        if (points > current)
        {
            map[name][problem] = points;
            map[name][0] = m - i;
        }
    }

    vector<array<int, 3>> s;
    // 0 points
    // 1 time
    // 2 name index

    for (int i = 0; i < n; i++)
    {
        string name = names[i];

        int points = 0;
        for (char c = 'A'; c < 'A' + k; c++)
        {
            points += map[name][c];
        }

        int time = map[name][0];

        s.pb({points, time, i});
    }

    sort(s.rbegin(), s.rend());

    for (int i = 0; i < n; i++)
    {
        cout << names[s[i][2]] << " " << s[i][0] << endl;
    }
}

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