Kayaks

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(int argc, char *argv[]) {
   int n, m;
   cin >> n >> m;
   int ranked = 0;
   vector<pair<int, int>> pos(9);

   string s;
   while(n--) {
      cin >> s;
      for (int i = m-2; i >= 0; --i) {
         if (s[i] >= '0' and s[i] <= '9') {
            int team = s[i] - '0' -1;
            pos[team] = {m - i, team};
            ranked++;
            break;
         }
      }
      if (ranked >= 9) break;
   }
   sort(pos.begin(), pos.end());

   vector<int> ranking(9);

   int curr = 0, prevd = -1;

   for (const auto &i : pos) {
      if (i.first > prevd) ++curr;
      ranking[i.second] = curr;
      prevd = i.first;
   }

   for (const int &i : ranking) cout << i << 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