Submission #1838036

---

Source Code Expand

#include <algorithm>
#include <iostream>
using namespace std;
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	long long int n, m, d[200000], t[200000], cnt = 0;
	cin >> n;
	for (int i = 0; i < n; i++) cin >> d[i];
	cin >> m;
	for (int i = 0; i < m; i++) cin >> t[i];
	if (n < m) {
		cout << "NO" << endl;
		return 0;
	}
	sort(d, d + n); sort(t, t + m);
	for (int i = 0; i < m; i++) {
		for (int j = cnt; j < n; j++) {
			if (t[i] == d[j]) {
				t[i] = 0;
				d[j] = 0;
				cnt = j + 1;
				if (i == m - 1) {
					cout << "YES" << endl;
					return 0;
				}
				break;
			}
		}
		if (t[i]) {
			cout << "NO" << endl;
			return 0;
		}
	}
	cout << "NO" << endl;
	return 0;
}

Submission Info

Judge Result