Kayaks

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <utility>
#include <set>

typedef long long LL;

using namespace std;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int nRows, nCols;
    cin >> nRows >> nCols;
    vector<pair<int,int> > V; // position, team
    for(int i = 0; i < nRows; i++){
        string line; cin >> line;
        for(int pos = 0; pos < nCols-2; pos++){
            if(line[pos+1] >= '1' && line[pos+1] <= '9'){
                V.push_back(make_pair(-pos, line[pos+1] - '0'));
                break;
            }
        }
    }
    sort(V.begin(), V.end());
    vector<int> ans(10);
    
    int rank = 0;
    for(int ship = 0; ship < 9; ship++){
        if(ship != 0 && V[ship-1].first == V[ship].first){
            ans[V[ship].second] = rank;
        }
        else{
            rank++;
            ans[V[ship].second] = rank;
        }
    }
    for(int team = 1; team <= 9; team++){
        cout << ans[team] << endl;
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED