Kayaks

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

bool c(pair<int,int> a, pair<int,int> b)
{
	return b.second < a.second;
}
bool d(pair<int,int> a, pair<int,int> b)
{
	return a.first < b.first;
}

int main()
{
	cin.sync_with_stdio(false);
	int n, m;
	vector<pair<int,int>> t(9);
	cin >> n >> m;
	char r[m];
	int k = 0;
	for (int i = 0; i < n; i++)
	{
		cin >> r;
		int j = 0;
		for (; j < m; j++)
		{
			if (r[j] >= '0' && r[j] <= '9')
			{
				break;
			}
		}
		if (j < m)
		{
			t[k] = pair<int,int>(r[j] - '0', j);
			k++;
		}
	}
	sort(t.begin(), t.end(), c);
	int p = 0, y = 1, q = 0, h = 1;
	for (int i = 0; i < 9; i++)
	{
		q = t[i].second;
		if (p == t[i].second)
		{
			y = t[i].second = y;
		}
		else
		{
			y = t[i].second = h++;
		}
		p = q;
	}
	sort(t.begin(), t.end(), d);
	for (int i = 0; i < 9; i++)
	{
		cout << t[i].second << 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