Kayaks

#include <iostream>
#include <string>
#include <stdlib.h>
#include <algorithm>
#include <vector>
#include <utility>

using namespace std;

int main(){
	string str;
	int n, m;
	cin >> n >> m;

	vector<pair<int,int> > positions;

	for(int i = 0; i < n; i++){
		cin >> str;
		for(int j = 0; j < m; j++){
			if(str[j] >= '1' && str[j] <= '9'){
				int team = str[j] - '0';
				int pos = max(0, m - j - 3);
				pair<int,int> p (pos, team);
				positions.push_back(p);
				break;
			}
		}
	}

	sort(positions.begin(), positions.end());

	int result[10];
	int last_pos = -1;
	int pos_index = 0;

	for(int i = 0; i < 9; i++){
		if(last_pos != positions[i].first){
			last_pos = positions[i].first;
			pos_index++;
		}
		result[positions[i].second] = pos_index;
	}

	for(int i = 1; i < 10; i++){
		cout << result[i] << "\n";
	}

	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