我想不考虑苹果的来序。行吗？
type
zu=array[1..2001]of longint;
var
n,m,i,pn,pm,k:longint;
ma,na:zu;
procedure qsort(h,t:longint;var a:zu);
var
i,j,temp,x:longint;
begin
i:=h;j:=t;x:=a[(h+t) div 2];
while i<=j do
begin
while a[i]<x do inc(i);
while a[j]>x do dec(j);
if i<=j then
begin
temp:=a[i];
a[i]:=a[j];
a[j]:=temp;
inc(i);dec(j);
end;
end;
if i<t then qsort(i,t,a);
if j>h then qsort(h,j,a);
end;
begin
readln(n,m);
for i:=1 to n do readln(na[i]);
for i:=1 to m do readln(ma[i]);
qsort(1,n,na);qsort(1,m,ma);
pn:=n;pm:=m;
while(pm<>0)and(pn<>0) do
begin
while(ma[pm]<na[pn])and(ma[pm]<>0)do
begin dec(pm);dec(pn);inc(k); end;
if (pm<>0)and(pn<>0) then
begin
dec(pm);
na[1]:=na[pn];
dec(pn);
if pn<>0 then qsort(1,pn,na);
end;
end;
writeln(m-k);
end.