Pagini recente » Cod sursa (job #3245429) | Cod sursa (job #710645) | Cod sursa (job #2079465) | Cod sursa (job #2706443) | Cod sursa (job #11377)
Cod sursa(job #11377)
program elimin;
const
fin='elimin.in';
fout='elimin.out';
type
matr=array[1..15,1..4000] of integer;
var
a,b:matr;
smax,s:longint;
st:array[0..15] of integer;
used:array[1..15] of boolean;
ss:array[1..4000] of longint;
m,n,r,c,i,j,k:longint;
procedure scufunda(i,n:longint);
var
p:longint;
begin
p:=i;
if i shl 1<=n then
if ss[i shl 1]>=ss[p] then
p:=i shl 1;
if i shl 1 or 1<=n then
if ss[i shl 1 or 1]>=ss[p] then
p:=i shl 1 or 1;
if p<>i then
begin
ss[p]:=ss[p] xor ss[i];
ss[i]:=ss[p] xor ss[i];
ss[p]:=ss[p] xor ss[i];
scufunda(p,n);
end;
end;
procedure hsort;
var
i:longint;
begin
for i:=n shr 1 downto 1 do
scufunda(i,n);
for i:=n downto 2 do
begin
ss[1]:=ss[1] xor ss[i];
ss[i]:=ss[1] xor ss[i];
ss[1]:=ss[1] xor ss[i];
scufunda(1,i-1);
end;
end;
function sum:longint;
var
i,j:integer;
s:longint;
begin
for i:=1 to m do
for j:=1 to n do
if used[i]=false then
b[i,j]:=a[i,j]
else
b[i,j]:=0;
s:=0;
for j:=1 to n do
begin
ss[j]:=0;
for i:=1 to m do
inc(ss[j],b[i,j]);
inc(s,ss[j]);
end;
hsort;
for i:=1 to c do
dec(s,ss[i]);
sum:=s;
end;
procedure back(x:integer);
var
i:integer;
begin
if x=r+1 then
begin
s:=sum;
if s>smax then
smax:=s;
end
else
begin
for i:=st[x-1]+1 to m do
begin
st[x]:=i;
used[i]:=true;
back(x+1);
used[i]:=false;
st[x]:=0;
end;
end;
end;
begin
assign(input,fin);
reset(input);
readln(m,n,r,c);
st[0]:=0;
if m>15 then
begin
for i:=1 to m do
for j:=1 to n do
read(a[j,i]);
m:=m xor n;
n:=m xor n;
m:=m xor n;
r:=r xor c;
c:=r xor c;
r:=r xor c;
end
else
begin
for i:=1 to m do
for j:=1 to n do
read(a[i,j]);
end;
close(input);
assign(output,fout);
rewrite(output);
smax:=0;
back(1);
writeln(smax);
close(output);
end.