Submission #1665354

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<iomanip>
typedef long long int ll;
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define EREP(i,n) for (int i=1;i<=(n);i++)
#define ALL(a) (a).begin(),(a).end()
//#define EVEL 1

#ifdef EVEL
#define DEB(X) cout << #X << ":" <<X<<" " ;
#define TF(f) f ? cout<<"true  " : cout<<"false ";
#define END cout<<"\n";
#else
#define DEB(X) {}
#define TF(f) {}
#define END {}
#endif
const int MOD = 1000000007;
const int INF = 2000000000;

    int N,D[200010];
    bool F[200010];
    int M,T[200010];
    bool ans=true;
    int pr=0;

int main(){
    ios_base::sync_with_stdio(false);
    cin>>N;
    REP(i,N)cin>>D[i];
    cin>>M;
    REP(i,M)cin>>T[i];
    if(N<M)ans=false;
    else{
        sort(D,D+N);sort(T,T+M);
        REP(i,M){
            for(int j=pr;j<N;j++){
                if(D[j]<T[i])pr++;
                DEB(i)DEB(j)DEB(pr)DEB(D[j])DEB(T[i])END
                if(T[i]==D[j]&&!F[j]){
                    F[j]=true;
                    pr=i+1;
                    break;
                }
                if(j==N-1){
                    ans=false;
                    break;
                }
            }
            if(!ans)break;
        }
    }
    cout<<(ans?"YES":"NO");
    return 0;
}

Submission Info

Judge Result