Основная часть решения:

int n, m;
int h[N];
char c;

void solve() {
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> c;
			if (c == '*') {
				h[j] = max(h[j], n - i);
			}
		}
	}
	int maxU = 0, maxD = 0;
	for (int i = 0; i < m - 1; i++) {
		int diff = h[i + 1] - h[i];
		if (diff > 0) {
			maxU = max(maxU, diff);
		} else {
			maxD = max(maxD, -diff);
		}
	}
	cout << maxU << ' ' << maxD << endl;
}

Основная часть решения:

int n, len, sum;
int a[N];

int main() {
	cin >> n;
	for (int i = 0; i < 2 * n; i++) {
		cin >> a[i];
		sum += a[i];
	}   	
	len = sum / n;
	sort(a, a + 2 * n);
	for (int i = 0; i < n; i++) {
		cout << a[i] << ' ' << len - a[i] << endl;
	}
}

Основная часть решения:

int n, m, sx, sy;
char a[N][N];   

int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
char dir[] = {'U', 'D', 'L', 'R'}; 

void solve() 
{
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++)
		{
			cin >> a[i][j];
			if (a[i][j] == 'S') {
				sx = i, sy = j;
			}
		}
	}
	a[sx][sy] = '*';
	int px = -1, py = -1;
    while (true) {
    	bool wasMove = false;
    	for (int i = 0; i < 4; i++) {
    		int nx = sx + dx[i];
    		int ny = sy + dy[i];
    		if (nx < 0 || nx >= n || ny < 0 || ny >= m) {
    			continue;
    		}
    		if (a[nx][ny] != '*') {
    			continue;
    		}
    		if (nx == px && ny == py) {
    			continue;    		
    		}
    		a[nx][ny] = '.';
    		px = sx, py = sy;
    		sx = nx, sy = ny;    		
    		cout << dir[i];	
    		wasMove = true;
    		break;
        }         
        if(wasMove) {
        	break;
        }
    }
    puts("");
}