Tulostaulu

input/code.cpp: In function 'void solve()':
input/code.cpp:42:53: warning: narrowing conversion of '((- names.std::vector<std::__cxx11::basic_string<char> >::size()) + 1)' from 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
   42 |         ord.push_back({tot, -a.se[10], -names.size()+1});
      |                                        ~~~~~~~~~~~~~^~

#include <bits/stdc++.h>

#define debug(x) cout << #x << ": " << x << endl
#define fi first
#define se second
#define all(x) begin(x),end(x)
#define rall(x) rbegin(x),rend(x)

using namespace std;
using ll = long long;

void solve() {
    int n, m, k;
    cin >> n >> m >> k;


    map<string, array<int, 11>> scr;
    for (int i = 0; i < n; ++i) {
        string name;
        cin >> name;
        scr[name][0] = 0;
    }

    for (int i = 0; i < m; ++i) {
        string name;
        char p;
        int s;
        cin >> name >> p >> s;
        if (s > scr[name][p-'A']) {
            scr[name][10] = i;
            scr[name][p-'A'] = s;
        }
    }

    vector<string> names;
    vector<array<int, 3>> ord;
    for (auto &a : scr) {
        names.push_back(a.fi);
        int tot = 0;
        for (int i = 0; i < 10; ++i)
            tot += a.se[i];
        ord.push_back({tot, -a.se[10], -names.size()+1});
    }

    stable_sort(rall(ord));
    for (auto &a : ord) {
        cout << names[-a[2]] << ' ' << a[0] << '\n';
    }
}

int main() {
    cin.tie(0) -> sync_with_stdio(0);

    solve();
}

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