Tulostaulu

#include<bits/stdc++.h>
using namespace std;
#define N 101
#define F first
#define S second

int n, m, k;
map<string, int> mem;
int arr[N][11];
pair<pair<int,int>, string> result[N];

int main () {
    cin >> n >> m >> k;
    for(int i=0;i<n;++i) {
        string nimi;
        cin >> nimi;
        mem[nimi] = i;
        result[i].second = nimi;
    }
    for(int i=0;i<m;++i) {
        string nimi;
        char teht;
        int pisteet;
        cin >> nimi >> teht >> pisteet;
        if (pisteet > arr[mem[nimi]][teht-'A']) {
            arr[mem[nimi]][teht-'A'] = pisteet;
            result[mem[nimi]].F.S = n-i; // aika
        }
    }
    for(int i=0;i<n;++i) {
        for (int j=0;j<k;++j) {
            result[i].F.F+=arr[i][j];
        }
    }
    sort(result, result+n);
    int g=-1;
    // for (int i=0;i<n;++i))
    for(int i=n-1;i>=0;--i) {
        if (result[i].F.F==0) {
            g = i;
            break;
        }
        cout << result[i].S << ' ' << result[i].F.F << endl;
    }
    for (int i=0;i<=g;++i) {
        cout << result[i].S << ' ' << result[i].F.F << 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