ac1272.pas

这是在网络上搜集到的在东京大学的ACM上面解决的一些题目的源码

program tju1272;
var
  n,s,min,i,cost,need:longint;
  ans:int64;
begin
  repeat
    read(n,s);min:=maxint;ans:=0;
    for i:=1 to n do begin
      read(cost,need);
      inc(min,s);if cost<min then min:=cost;
      inc(ans,min*need);
    end;
    writeln(ans);
  until seekeof;
end.