C++ Easy Solution
\nclass Solution {\npublic:\n    int maximumRows(vector<vector<int>>& v, int k) {\n        int n=v.size(),m=v[0].size();\n        int ans=0;\n        for(int i=
```\nclass Solution {\npublic:\n    int maximumRows(vector<vector<int>>& v, int k) {\n        int n=v.size(),m=v[0].size();\n        int ans=0;\n        for(int i=0;i<(1<<12);i++){\n            string s="";\n            int c=0;\n            for(int j=0;j<12;j++){\n                if(i&(1<<j)) s+=\'1\';\n                else s+=\'0\';\n                if(s[j]==\'1\') c++;\n            }\n            if(c!=k) continue;\n            int cnt=0;\n            for(int x=0;x<n;x++){\n                bool ok=true;\n                for(int y=0;y<m;y++){\n                    if(v[x][y]==1 and s[y]!=\'1\') {ok=false;break;}\n                }if(ok) cnt++;\n            }ans=max(ans,cnt);\n        }return ans;\n    }\n};\n```
[]