题解 | 小红的矩阵染色 | 进食后人 ：不用 vector 静态数组要开够

#include <bits/stdc++.h>
using namespace std;

const int N = 1e3 + 5;

int n, m, k;
char mat[N][N];
int a[N*N], sz;

void solve() {
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> mat[i][j];
        }
    }
    sz = 0;
    for (int j = 1; j <= m; j++) {
        for (int i = 1; i <= n; i++) {
            if(mat[i][j] == 'o') {
                int p = i;
                while(p <= n && mat[p][j] == 'o') p++;
                a[++sz] = p - i;
                i = p;
            }
        }
    }
    int ans = 0;
    sort(a + 1, a + 1 + sz);
    for (int i = sz; i >= 1; i--) {
        if (k > 0) {
            int tk = min(k, a[i]);
            ans += tk - 1;
            k -= tk;
        }
    }
    cout << ans << "\n";
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int T = 1;
    // cin >> T;
    while (T--) solve();
}
// 64 位输出请用 printf("%lld")