Tulostaulu

#include <bits/stdc++.h>
#define ln "\n";
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m,k;
    cin >> n >> m >> k;
    map<string,vector<int>> mp;
    vector<vector<string>> orders(4000);
    for(int i = 0; i < n; i++) {
        string g;
        cin >> g;
        mp[g] = vector<int>(20);
    }
    for(int i = 0; i < m; i++) {
        string g;
        char d;
        int a;
        cin >> g >> d >> a;
        // cout << g << " ";
        // cout << mp[g][d-'A'] << " ";
        mp[g][d-'A'] = max(mp[g][d-'A'],a);
        // cout << mp[g][d-'A'] << ln;
        int s = 0;
        for(int i = 0; i < 15; i++) {
            s+= mp[g][i];
        }
        orders[s].push_back(g);
    }
    set<string> s;
    for(int i = 3000; i > 0; i--) {
        if(orders[i].size() == 0) continue;
        for(string g:orders[i]) {
            if(s.find(g) == s.end()) {
                cout << g << " " << i << ln;
                s.insert(g);
            }  
        }
    }
    for(auto [key,val]:mp) {
        if(s.find(key) == s.end()) {
            cout << key << " 0" << ln;
        }
    }
}

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