Tulostaulu

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
 
typedef tree<int,null_type,less<>,rb_tree_tag,tree_order_statistics_node_update> index_set;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
 
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define FOR(i,a,b) for (int i = a; i < b; i++)
 
constexpr ll MOD = 1000000007;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n, m, k; cin >> n >> m >> k;
    map<string, int> np;
    FOR(i,0,n) {
        string x; cin >> x;
        np[x] = 0;
    }
    vector<pair<pair<string, char>, int>> pp;
    FOR(i,0,m) {
        string x; cin >> x;
        char c; cin >> c;
        int p; cin >> p;
        pp.PB({{x, c}, p});
    }
    vector<pair<pair<string, char>, int>> tpp = pp;
    sort(pp.begin(), pp.end());
    //FOR(i,0,m) {
    //    cout << "\n" << pp[i].F.F << " " << pp[i].F.S << " " << pp[i].S << "\n\n";
    //}
    string cs = pp[0].F.F;
    int ma = 0;
    char pc = pp[0].F.S;
    FOR(i,0,m) {
        if (pp[i].F.S != pc || pp[i].F.F != pp[i-1].F.F) {
            np[pp[i-1].F.F] += ma;
            ma = 0;
        }
        ma = max(ma, pp[i].S);
        //cout << ma << "\n";
        pc = pp[i].F.S;
    }
    np[pp[m-1].F.F] += ma;
    map<string, int> cp, la;
    int kk = 0;
    for (auto i : tpp) {
        cp[i.F.F] += i.S;
        if (cp[i.F.F] == np[i.F.F]) la[i.F.F] = kk;
        kk++;
    }
    set<pair<pair<int, int>, string>, greater<>> fso;
    for (auto i : np) {
        fso.insert({{i.S, la[i.F]}, i.F});
    }
    int ccc = 0;
    for (auto i : fso) {
        if (ccc >= n) break;
        cout << i.S << " " << i.F.F << "\n";
        ccc++;
    }
}

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: RUNTIME ERROR

Test 5

Group: 3

Verdict: WRONG ANSWER

Test 6

Group: 3

Verdict: WRONG ANSWER