noip2012国王游戏

program tt;
var ans,c,d:array[1..5000]of integer;
    a,b:array[0..1000]of longint;
    t,p,x,i,j,n,lc,ld,lans:longint;
procedure qsort(x,y:longint);
var i,j,mid,t:longint;
begin
 i:=x;j:=y;
 mid:=a[(x+y) div 2]*b[(x+y) div 2];
 repeat
  while a[i]*b[i]mid do j:=j-1;
  if i<=j then
   begin
    t:=a[i];a[i]:=a[j];a[j]:=t;
    t:=b[i];b[i]:=b[j];b[j]:=t;
    i:=i+1;j:=j-1;
   end;
 until i>j;
 if i1) do len:=len-1;
 ld:=len;
end;

function compare:boolean;//！！，改为万位同样适用
var i:longint;
begin
 for i:=ld downto 1 do
  begin
   if d[i]>ans[i] then exit(true);
   if d[i]0 do
  begin
   lc:=lc+1;
   c[lc]:=a[0] mod 10000;
   a[0]:=a[0] div 10000;
  end;
 for i:=1 to n do
  begin
   chu(b[i]);
   if lans0 do
    begin
     lc:=lc+1;
     c[lc]:=x mod 10000;
     x:=x div 10000;
    end;
  end;
 print;
 readln;readln;
end.