Kayaks

#include <bits/stdc++.h>

using namespace std;

int tab[10];
priority_queue< pair< int,int> > msc;
int res[10];
string wod[31];
int main()
{
    int n,m;
    cin >> n >> m;
    for(int i=0;i<n;++i)
    {
        cin >> wod[i];
    }
    for(int i=0;i<n;++i)
    {
        for(int j=1;j<m-1;++j){
            if(wod[i][j]!='.'){
                tab[ wod[i][j]-'1'+1 ] = j;
                msc.push(make_pair( j , (wod[i][j]-'1'+1) ));
                break;
            }
        }
    }

    int place=1;
    pair<int,int> pom=msc.top();
    msc.pop();
    res[pom.second]=place;
    int poprz = pom.first;
    while(msc.empty()==false){
        pair<int,int> pom=msc.top();
        msc.pop();
        if(pom.first<poprz)place++;
        res[pom.second]=place;
        poprz=pom.first;
    }

    for(int i=1;i<=9;++i){
        cout<< res[i] << endl;
    }

    return 0;
}

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