Pagini recente » Cod sursa (job #2427566) | Cod sursa (job #836007) | Cod sursa (job #3194838) | Cod sursa (job #1917339) | Cod sursa (job #1482016)
#define _CRT_SECURE_NO_DEPRECATE
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <algorithm>
#define MAXN 7300
int N, M, R, C, A[MAXN][MAXN];
int RSum[MAXN], LSum[MAXN], maxx, Tsum, minn = 0x3f3f3f3f;
int in[MAXN];
inline bool cmp(int x, int y) { return x < y; }
inline bool check(int i, int lim){
int x = i, j = 0;
for (; x; x -= x & -x, ++j);
return j <= lim;
}
int main(){
assert(freopen("elimin.in", "r", stdin));
freopen("elimin.out", "w", stdout);
scanf("%d %d %d %d", &M, &N, &R, &C);
//assert((M < N ? M : N) < 32);
if (M <= N){
for (int i = 0; i < M; ++i)
for (int j = 0; j < N; ++j)
scanf("%d ", &A[i][j]),
LSum[i] += A[i][j],
RSum[j] += A[i][j];
R ^= C ^= R ^= C;
}
else {
for (int i = 0; i < M; ++i)
for (int j = 0; j < N; ++j)
scanf("%d ", &A[j][i]),
LSum[j] += A[j][i],
RSum[i] += A[j][i];
}
printf("%d", Tsum - minn);
return 0;
}