Tulostaulu

#include<bits/stdc++.h>
using namespace std;
#define int long long // xd

typedef vector<int> vi;
typedef pair<int,int> pi;
#define pb push_back
#define fi first
#define se second

#define INF LLONG_MAX/2-1
#define M 1000000007
#define N 100100


void solve(){
    int n,z,k;
    cin >> n >> z >> k;
    map<string,int> m;
    map<int,string> rev;

    for(int i=0; i<n; i++){
        string in;
        cin >> in;
        m[in]=i;
        rev[i]=in;
    }
   
    vector<array<int,20>> sb(N);
    for(int i=0; i<z; i++){
        string name; char prob; int sco;
        cin >> name >> prob >> sco;
        sb[m[name]][prob-65]= max(sb[m[name]][prob-65], sco);
    }

    vector<pi> ans(n);
    for(int i=0; i<n; i++){
        int sco=0;
        for(int j=0; j<k; j++){
            sco+= sb[i][j];
        }
        ans[i]={sco,i};
    }

    sort(ans.rbegin(), ans.rend());
    for(auto x:ans){
        cout << rev[x.se] << " " << x.fi << "\n";
    }
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    int tt=1;
    while(tt--) solve();

    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: WRONG ANSWER

Test 6

Group: 3

Verdict: WRONG ANSWER