Pagini recente » Cod sursa (job #852308) | Cod sursa (job #838739) | Cod sursa (job #1616395) | Cod sursa (job #652555) | Cod sursa (job #2629099)
#include <bits/stdc++.h>
#define newline '\n'
using namespace std;
ifstream fin("elimin.in");
ofstream fout("elimin.out");
///***********************
const int NMAX = 15, MMAX = 7300;
int matrix[NMAX][MMAX], sumCol[MMAX];
int n, m, r, c, ans;
void read()
{
fin >> n >> m >> r >> c;
if (n > m)
{
swap(n, m);
swap(r, c);
}
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
fin >> matrix[i][j];
}
void solve()
{
for (int state = 0; state < NMAX; state++)
{
if (state != r)
continue;
fill(sumCol, sumCol + n, 0);
for (int i = 0; i < n; i++)
{
if (!bool((1 << state) & i))
{
for (int j = 0; j < m; j++)
sumCol[j] += matrix[i][j];
}
}
sort(sumCol, sumCol + m);
int sum = 0;
for (int j = c; j < m; j++)
sum += sumCol[j];
ans = max(ans, sum);
}
fout << ans << newline;
}
int main()
{
read();
solve();
fout.close();
return 0;
}