Vijos P1521 跳舞 贪心

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <algorithm>
 4 
 5 const int maxN=51;
 6 
 7 int boy[maxN]={0};
 8 int girl[maxN]={0};
 9 
10 char map[maxN];
11 int N,K;
12 
13 int main()
14 {
15     scanf("%d%d",&N,&K);
16     for(int i=0;i<N;i++) 
17     {
18         scanf("%s",map);
19         for(int j=0;j<N;j++) 
20             if(map[j]==‘Y‘) { boy[i+1]++; girl[j+1]++; }
21     }
22     int ans=10000000;
23     
24     using std::min;
25     for(int i=1;i<=N;i++)
26         ans=min(ans,min(boy[i],girl[i]));
27     printf("%d\n",min(ans+K,N));
28     return 0;
29 }