Submission #1868478

---

Source Code Expand

#include <iostream>
#include <string>
#include<algorithm>

int main() {
	int n, flag = 0;
	std::cin >> n;
	int a[200000];
	for (int i = 0;i < n;i++) {
		std::cin >> a[i];
	}
	std::sort(a, a + n);
	int m, now = 0;
	std::cin >> m;
	int b[200000];
	for (int i = 0;i < m;i++) {
		std::cin >> b[i];
	}
	std::sort(b, b + m);
	for (int i = 0;i < m;i++) {
		int F = 0;
		for (int j = now;j < n;j++)
			if (a[j] == b[i]) {
				F = 1;
				now = j;
			}
		if (F == 0)
			flag = 1;
	}
	if (flag == 1)
		std::cout << "NO" << std::endl;
	else std::cout << "YES" << std::endl;
	return 0;
}

Submission Info

Judge Result