极其坑逼的结果

#include<cstdio>
#include<algorithm>
using namespace std;
int apple[201],taotao[201];
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    int left=m;
    for (int i=0;i<n;++i)
     scanf("%d",&apple[i]);
    for (int i=0;i<m;++i)
     scanf("%d",&taotao[i]);
    sort(apple,apple+n);
    sort(taotao,taotao+m);
    for (int i=n-1;i>0;--i)
     for (int j=m-1;j>0;--j)
     {
         if (apple[i]>taotao[j])
         {
             left--;
             taotao[j]=301;
             break;
        }
     }
    printf("%d",left);
    return 0;
}