job.pas

Magio牛的usaco源代码

{
ID:maigoak1
PROG:job
}

program job;
const
  maxn=1000;
  maxm=30;
var
  fin,fout:text;
  ja,jb:array[1..maxn]of word;
  a,b:array[1..maxm]of byte;
  ta,tb:array[1..maxm]of word;
  n,m1,m2,i,j,t,ans:word;
begin
  assign(fin,'job.in');
  reset(fin);
  read(fin,n,m1,m2);
  for i:=1 to m1 do begin read(fin,a[i]);ta[i]:=a[i];end;
  for i:=1 to m2 do begin read(fin,b[i]);tb[i]:=b[i];end;
  close(fin);

  for i:=1 to n do begin
    t:=1;for j:=2 to m1 do if ta[j]<ta[t] then t:=j;ja[i]:=ta[t];inc(ta[t],a[t]);
    t:=1;for j:=2 to m2 do if tb[j]<tb[t] then t:=j;jb[n+1-i]:=tb[t];inc(tb[t],b[t]);
  end;

  assign(fout,'job.out');
  rewrite(fout);
  t:=1;for i:=2 to n do if ja[i]+jb[i]>ja[t]+jb[t] then t:=i;
  writeln(fout,ja[n],' ',ja[t]+jb[t]);
  close(fout);
end.