bzoj2426

稍微列个式子就知道是贪心

var w,h,c,a,f:array[0..50010] of longint;
    m,b,h0,n,i,p,j,x,ans,s:longint;

procedure swap(var a,b:longint);
  var c:longint;
  begin
    c:=a;
    a:=b;
    b:=c;
  end;

procedure sort(l,r: longint);
  var i,j,x,y: longint;
  begin
    i:=l;
    j:=r;
    x:=a[(l+r) div 2];
    repeat
      while a[i]<x do inc(i);
      while x<a[j] do dec(j);
      if not(i>j) then
      begin
        swap(a[i],a[j]);
        swap(f[i],f[j]);
        inc(i);
        j:=j-1;
      end;
    until i>j;
    if l<j then sort(l,j);
    if i<r then sort(i,r);
  end;

begin
  readln(m,b,h0,n);
  for i:=1 to m do
    read(w[i]);
  for i:=1 to n do
    read(h[i]);
  for i:=1 to m do
    read(c[i]);
  ans:=2147483647;
  for i:=1 to n do
  begin
    s:=h0+h[i];
    for j:=1 to m do
    begin
      read(x);
      a[j]:=c[j]-x;
      f[j]:=j;
      s:=s+w[j]*x;
    end;
    sort(1,m);
    x:=0;
    for j:=1 to m do
      if x+w[f[j]]<b then
      begin
        x:=x+w[f[j]];
        s:=s+a[j]*w[f[j]];
      end
      else begin
        s:=s+a[j]*(b-x);
        break;
      end;
    if ans>s then
    begin
      p:=i;
      ans:=s;
    end;
  end;
  writeln(p);
  writeln(ans);
end.