题解 | 小红的矩阵染色

n, m, k = map(int,input().split())
arr = []
for i in range(n):
    arr.append(list(input()))
score = 0
# 求纵向最长的o
count_o = {}
for i in range(n):
    for j in range(m):
        if j not in count_o:
            count_o[j] = arr[i][j]
        else:
            count_o[j] += arr[i][j]
count = []
for value in count_o.values():
    value = value.split("*")
    value = [len(i) for i in value if i != ""]
    for i in value:
        count.append(i)
sort_count = sorted(count,reverse=True)
for num in sort_count:
    if k <= num:
        score += k - 1
        break
    else:
        score += num - 1
        k -= num
print(score)