Tulostaulu

#include<bits/stdc++.h>
#define FOR(i, n) for (i = 0; i < n; ++i)
using namespace std;

int main() {
    int n, m, k, i, j, p=0, q;
    cin >> n >> m >> k;
    string s;

    map<string, int> mp1;
    map<int, string> mp2;
    vector<pair<int, string>> sum;
    vector<int> tot(n, 0);
    vector<int> pos(n, 0);
    vector<string> order(n);
    vector<vector<int>> scores(n, vector<int>(k, 0));

    FOR (i, n) {
        cin >> s;
        order[i] = s;
        mp1[s] = p;
        mp2[p] = s;
        tot[p] = 0;
        ++p;
    }
    sort(order.rbegin(), order.rend());
    FOR (i, n) {
        pos[mp1[order[i]]] = i;
    }

    char ch; int x;
    FOR (q, m) {
        cin >> s >> ch >> x;
        p = mp1[s];
        if (scores[p][ch-'A'] < x) {
            tot[p] += x-scores[p][ch-'A'];
            scores[mp1[s]][ch-'A'] = x;


        /*
            sum[find_index(sum, s)].first += x-scores[mp1[s]][ch-'A'];
            sort(sum.rbegin(), sum.rend());*/
        }

        FOR(i, n) {
            FOR (j, n) {
                if (j == 0) continue;
                if (tot[mp1[order[j]]] > tot[mp1[order[j-1]]]) {
                    swap(order[j], order[j-1]);
                }
            }
        }
    }
    FOR (i, n) {
            cout << order[i] << " " << tot[mp1[order[i]]];
            cout << endl;
        }
}

Test 1

Group: 1, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 3

Verdict: TIME LIMIT EXCEEDED