C++ :

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
	//freopen("apple2.in","r",stdin);
//	freopen("apple2.out","w",stdout);
	int n,m,a[2001],b[2001];
	int j;
	int ans=0;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	for(int i=1;i<=m;i++)
		cin>>b[i];
	sort(b+1,b+m+1,less<int>());
	sort(a+1,a+n+1,greater<int>());
	for(int i=1;i<=n;i++)
	    for(int j=1;j<=m;j++)
			if(a[i]>b[j])
			{
				ans++;break;
			}
  cout<<m-ans;
 // system("pause");

}

Pascal :

 var
b:array[0..3000]of longint;
a:array[0..3000]of longint;
i,n,sum,m,t:longint;
begin
  reset(input);
  rewrite(output);
  for i:=1 to 300 do   b[i]:=0;
  readln(n,m);
  for i:=1 to n do
    readln(a[i]);
  for i:=1 to m do
    begin
      readln(t);
      b[t]:=b[t]+1;
    end;
  sum:=0;
  while n>0 do
    begin
      t:=a[n]-1;
      while (b[t]=0)and(t>0) do
        t:=t-1;
      if (b[t]>0) then
        b[t]:=b[t]-1;
      n:=n-1;
    end;
  for i:=1 to 300 do
    sum:=sum+b[i];
  writeln(sum);
end.