Tulostaulu

input/code.cpp: In function 'bool ss(item, item)':
input/code.cpp:23:7: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   23 |     if(x.p == y.p)
      |       ^

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <ll> vl;
typedef vector <vl> vvl;
typedef pair <ll, ll> pl;
typedef vector <pl> vpl;
typedef stack <ll> stl;
typedef set <ll> sl;
 
#define fi first
#define se second
 
map <ll, string> ml;
 
struct item
{
    ll p, ord, t;
};
 
bool ss(item x, item y)
{
    if(x.p == y.p)
        if(x.p == 0)
            return ml[x.ord] < ml[y.ord];
        else
            return x.t < y.t;
    return x.p > y.p;
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
 
    ll n, m, k, no, sum, i, j;
    string s; char t;
    map <string, ll> mp;
    cin >> n >> m >> k;
    vvl score(n + 1, vl(k, 0));
    vl time(n + 1, 0);
 
    for(i = 0; i < n; i++)
    {
        cin >> s;
        mp[s] = i;
        ml[i] = s;
    }
 
    for(i = 0; i < m; i++)
    {
        cin >> s >> t >> sum;
        no = mp[s];
        if(sum > score[no][t - 'A'])
        {
            score[no][t - 'A'] = sum;
            time[no] = i;
        }
    }
 
    vector <item> ans(n);
    item cur;
    for(i = 0; i < n; i++)
    {
        sum = 0;
        for(j = 0; j < k; j++)
        {
            sum += score[i][j];
            //cerr << score[i][j] << " ";
        }
 
        cur.p = sum; cur.ord = i; cur.t = time[i];
        ans[i] = cur;
    }
    sort(ans.begin(), ans.end(), ss);
    for(i = 0; i < n; i++)
        cout << ml[ans[i].ord] << " " << ans[i].p << "\n";
 
    return 0;
}

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