Submission #1692087

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;

int main(){
	int n;
	cin >> n;
	vector<int> d;
	for (int i = 0; i < n; i++) {
		int tmp;
		cin >> tmp;
		d.push_back(tmp);
	}
	
	sort(d.begin(), d.end());

	int m;
	bool flag;
	cin >> m;
	//vector<int> t;
	for(int i = 0; i < m; i++) {
		int tmp;
		cin >> tmp;
		if (binary_search(d.begin(), d.end(), tmp)) {
			for (int j = 0; j < n; j++) {
				if (d[j] == tmp) {
					d.erase(d.begin()+j);
					n--;
				}
			}
		} else {
			cout << "NO";
			return 0;
		}

	}

	cout << "YES";

	//sort(t.begin(), t.end());

	/*
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (d[i] == t[j]) {
				d.erase(d.begin()+i);
			} else  if(d[i] >= t[j]){
				
			}
		}
	}
	*/

	

	return 0;
}

Submission Info

Judge Result