拼多多-六一儿童节【贪心】

#include<bits/stdc++.h>

using namespace std;

const int maxn = 1e5+5;
int n,m;
int h[maxn], w[maxn];
int main()
{
    cin>>n;
    for(int i=0;i<n;i++) cin>>h[i];
    cin>>m;
    for(int i=0;i<m;i++) cin>>w[i];
    sort(h,h+n);
    sort(w,w+m);
    int i=0, j=0, cnt = 0;
    while(i<n && j<m)
    {
        if(w[j]>=h[i])
        {
            i++;
            j++;
            cnt++;
        }
        else
        {
            j++;
        }
    }
    cout<<cnt<<endl;
}

https://www.nowcoder.com/practice/d2dfc62bf1ba42679a0e358c57da9828?tpId=90&tqId=30778&tPage=1&rp=1&ru=%2Fta%2F2018test&qru=%2Fta%2F2018test%2Fquestion-ranking