JSOI2007建筑抢修

 1 var  i,n,cnt,time:longint;
 2      p,t,a:array[0..200000] of longint;
 3 procedure put(x:longint);
 4  var i,k:longint;
 5  begin
 6    inc(cnt);
 7    i:=cnt;k:=i>>1;
 8    while k>=1 do
 9     begin
10       if a[k]then begin a[i]:=a[k];i:=k;k:=k>>1;end
11       else k:=0;
12     end;
13    a[i]:=x;
14  end;
15 procedure get(x:longint);
16  var i,k:longint;
17  begin
18    i:=1;k:=i1;
19    while kdo
20     begin
21       if (kand (a[k+1]>a[k]) then inc(k);
22       if a[k]>x then begin a[i]:=a[k];i:=k;k:=k1;end
23       else k:=cnt+1;
24     end;
25    a[i]:=x;
26  end;
27 procedure sort(h,l:longint);
28  var i,j,x,y,temp:longint;
29  begin
30    i:=h;j:=l;x:=p[(i+j)>>1];y:=t[(i+j)>>1];
31    repeat
32      while (p[i]do inc(i);
33      while (p[j]>x) do dec(j);
34      if ithen
35       begin
36         temp:=p[i];p[i]:=p[j];p[j]:=temp;
37         temp:=t[i];t[i]:=t[j];t[j]:=temp;
38         inc(i);dec(j);
39       end;
40    until i>j ;
41    if ithen sort(i,l);
42    if j>h then sort(h,j);
43  end;
44 procedure init;
45  begin
46    readln(n);
47    for i:=1 to n do readln(t[i],p[i]);
48    sort(1,n);
49  end;
50 procedure main;
51  begin
52    time:=0;
53    cnt:=0;
54    for i:=1 to n do
55     begin
56       if time+t[i]then
57         begin
58           put(t[i]);inc(time,t[i]);continue;
59         end;
60       if (time-a[1]+t[i]and (t[i]1]) then
61         begin
62           inc(time,t[i]-a[1]);get(t[i]);continue;
63         end;
64     end;
65    writeln(cnt);
66  end;
67 begin
68   init;
69   main;
70 end.