Tulostaulu

input/code.cpp: In function 'int main()':
input/code.cpp:55:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for (int i = 1; i <= n - zeropl.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~
input/code.cpp:58:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for (int i = 1; i <= zeropl.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~
input/code.cpp:62:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for (int i = 1; i <= zeropl.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~
input/code.cpp:18:9: warning: unused variable 'how' [-Wunused-variable]
   18 |     int how = 1;
      |         ^~~

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
//sort(v.begin(), v.end());
int kilp[550][11];
int aikat[550];
map<string, int> nimidexi;
map<int, string> dexinimi;
map<int, int> aikapela;
vector<pair<int, int>> stats;
vector<int> zeropl;
vector<string> nimj;
//2 3 2 kalle ville kalle A 2 ville B 7 ville A 18

int main() {
    int how = 1;
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> v;
    for (int i = 1; i <= n; i++) {
        string st1;
        cin >> st1;
        nimidexi[st1] = i;
        dexinimi[i] = st1;
    }
    for (int i = 1; i <= m; i++) {
        string st2;
        string tnmr;
        int sc1;
        cin >> st2 >> tnmr >> sc1;
        int tnmr1 = tnmr[0] - 64;
        if (sc1 > kilp[nimidexi[st2]][tnmr1]) {
            kilp[nimidexi[st2]][tnmr1]=sc1;
            aikat[nimidexi[st2]] = i;
        }
    }
    for (int i = 1; i<= n; i++) {
        aikapela[aikat[i]] = i;
        int tscr;
        tscr = 0;
        for (int j = 1; j <= 10; j++) {
            tscr = tscr + kilp[i][j];
        }
        if (tscr == 0) {
            zeropl.push_back(i);
        }
        pair<int, int> statp;
        statp.first = tscr;
        statp.second = -aikat[i];
        stats.push_back(statp);
    }
    sort(stats.begin(), stats.end());
    for (int i = 1; i <= n - zeropl.size(); i++) {
        cout << dexinimi[aikapela[-stats[n-i].second]] << " " << stats[n-i].first << "\n";
    }
    for (int i = 1; i <= zeropl.size(); i++) {
        nimj.push_back(dexinimi[zeropl[i-1]]);
    }
    sort(nimj.begin(), nimj.end());
    for (int i = 1; i <= zeropl.size(); i++) {
        cout << nimj[i-1] << " " << 0 << "\n";
    }
}

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