【hrbust2294】方方正正

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define N 100006
int i,m,n;
long long rs,cs,r[N],c[N],w[N];
int main(){
    while(~scanf("%d%d",&m,&n)){//m行n列
        rs=cs=0;
        memset(w,0,sizeof w);

        for(i=1;i<=m;i++){
            scanf("%d",&r[i]);
            rs+=r[i];
            w[r[i]]++;//w[i]：行和为i的有几个
        }

        for(i=1;i<=n;i++){
            scanf("%d",&c[i]);
            cs+=c[i];
        }

        if(rs!=cs){
            puts("NO");
            continue;
        }

        sort(c+1,c+1+n,greater<long long>());

        for(i=n;i;i--)w[i]+=w[i+1];//w[i]：行和大于等于i的有几个

        for(i=1;i<=n;i++){
            c[i]+=c[i-1];
            w[i]+=w[i-1];
            if(c[i]>w[i])//w就是R*，若c[i]>w[i]表明R*不能盖过S
                break;
        }

        if(i==n+1) puts("YES");
        else puts("NO");
    }
    return 0;
}