题解 | 小红的矩阵染色

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

using namespace std;

bool cmp(int num1,int num2){
    return num1>num2;
}
int main() {
    int a, b,c;
    cin>>a>>b>>c;
    char ch[a][b];
    for (int i = 0; i < a; ++i) {
        cin>>ch[i];
    }
    int count=0;
    vector<int> nums;
    for (int i = 0; i < b; ++i) {
        for (int j = 0; j < a; ++j) {
            if (ch[j][i]!='*'){
                count++;
            }
            if (ch[j][i]=='*'){
                if (count==0){nums.push_back(count);}
                else{nums.push_back(count-1);}
                count=0;
            }
            if (j==a-1&&count>1){
                nums.push_back(count-1);
                count=0;
            }
        }
        count=0;
    }
    sort(nums.begin(),nums.end(), cmp);
    count=0;
    int sign=0;
    for( int i:nums){
        count=count+i+1;
        sign+=i;
        if (count>=c){
            int num=count-c;
            if (num==0){
                break;
            } else{
                sign=sign-num;
                break;
            }
        }
    }

    cout<<sign<<" ";
}
// 64 位输出请用 printf("%lld")