Tulostaulu

#include <bits/stdc++.h>

using namespace std;

int n, m, k;
vector<string> v;
map<pair<string, char>, int> p;
map<string, pair<int,int>> d;
vector<pair<pair<int,int>, string>> score;
vector<string> names;

int main(){
    cin >> n >> m >> k;

    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        v.push_back(s);
    }

    for(int i = 1; i <= m; i++){
        string s; char c; int u;
        cin >> s >> c >> u;
        if (u > p[{s, c}]){
            d[s] = {d[s].first + u - p[{s, c}], -i};
            p[{s, c}] = u - p[{s, c}];
        }
    }

    for(auto i : v){
        if(d[i].first > 0) score.push_back({d[i], i});
        else names.push_back(i);
    }
    sort(score.begin(), score.end());
    reverse(score.begin(), score.end());
    sort(names.begin(), names.end());

    for(auto i : score){
        cout << i.second << " " << i.first.first << endl;
    }
    for(auto i : names) {
        cout << i << " 0" << endl;
    }
}

Test 1

Group: 1, 3

Verdict: WRONG ANSWER

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