ac1100.pas

某牛人写的acm.tongji.edu.cn上大部分ac的代码,仅供学习研究,请不要用来作弊

program tju1100;
const
  maxbad=20;
  maxtime=600;
var
  time:array[1..maxbad]of byte;
  ok:array[0..maxtime]of boolean;
  a,b,c,d:byte;
function need(n:byte):word;
  var
    i,j,s:word;
  begin
    s:=0;
    for i:=1 to n do begin
      read(time[i]);inc(s,time[i]);
    end;

    fillchar(ok,sizeof(ok),0);ok[0]:=true;
    for i:=1 to n do
      for j:=s div 2 downto 0 do
        if ok[j] then ok[j+time[i]]:=true;
    j:=s div 2;while not ok[j] do dec(j);
    need:=s-j;
  end;
begin
  repeat
    read(a,b,c,d);
    writeln(need(a)+need(b)+need(c)+need(d));
  until seekeof;
end.