Submission #2233617

---

Source Code Expand

#include "bits/stdc++.h"
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 REPm(i,n) for(int i=(n)-1;i>=0;i--)
#define REP1(i,n) for(int i=1;i<=(n);i++)
typedef long long ll;
int main(){
    int N,M;
    vector<int> D;
    vector<int> T;
    int input;
    cin >> N;
    REP(i,N){
        cin >> input;
        D.push_back(input);
    }
    cin >> M;
    REP(i,M){
        cin >> input;
        T.push_back(input);
    }
    sort(D.begin(),D.end());
    sort(T.begin(),T.end());
    int index1 = 0;
    int index2 = 0;
    while(index1 < N && index2 < M){
        if(D[index1] > T[index2]){
            break;
        }
        if(D[index1] == T[index2]) index2++;
        index1++;
    }
    if(index2 == M) cout << "YES" << endl;
    else cout << "NO" << endl;
    return 0;
}

Submission Info

Judge Result