Cod sursa(job #1599941)
| Utilizator | Data | 14 februarie 2016 15:53:06 | |
|---|---|---|---|
| Problema | Nunta | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("submat.in");
ofstream fout("submat.out");
int n, m;
int v[1005];
int main()
{
int i, j, x;
fin >> n >> m;
for(i = 1; i <= n; i++)
for(j = 1; j <= m; j++)
{
fin >> x;
if(x == 0) v[i]++;
}
sort(v + 1, v + 1 + n, greater<int>());
//for(i = 1; i <= n; i++)
// fout << v[i] << " ";
int smax = 0;
for(i = 1; i <= n; i++)
smax = max(smax, v[i] * i);
fout << smax;
return 0;
}
