题解 | 小红的矩阵染色

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;


public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int k = sc.nextInt();
        sc.nextLine();
        char[][] charArr = new char[n][m];
        for (int i = 0; i < n; i++) {
            charArr[i] = sc.nextLine().toCharArray();
        }
        ArrayList<Integer> list = new ArrayList<>();
        for (int j = 0; j < m; j++) {
            int charO = 0;
            for (int i = 0; i < n; i++) {
                if (charArr[i][j] == 'o') {
                    charO++;
                } else {
                    if (charO >= 2) {
                        list.add(charO);
                    }
                    charO = 0;
                }
            }
            if (charO >= 2) {
                list.add(charO);
                charO = 0;
            }

        }
        Collections.sort(list, new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o2 - o1;
            }
        });
        int score = 0;
        for (int i = 0; i < list.size(); i++) {
            if (k == 0) {
                break;
            }
            int cellsToBye = Math.min(k, list.get(i));
            if (cellsToBye >= 2) {
                score += cellsToBye - 1;
            }
            k = k - cellsToBye;
        }
        System.out.println(score);



    }
}