Submission #546674

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector> 
using namespace std;

int main(){
	int N, M;
	vector<int> A;
	vector<int> B;

	cin >> N;
	cin >> M;
	
	for (int i = 0; i < N; i++){
		int k;
		cin >> k;
		A.push_back(k);
	}
	for (int i = 0; i < M; i++){
		int k;
		cin >> k;
		B.push_back(k);
	}

	if (N < M){
		cout << "NO" << endl;
		return 0;
	}


	sort(A.begin(), A.end());
	sort(B.begin(), B.end());

	int n=0, m=0;

	while (n < N && m < M){
		if (A[n] >= B[m]){
			m++;
		}
		n++;
	}

	if (m == M){
		cout << "YES" << endl;
		return 0;
	}
	cout << "NO" << endl;
	return 0;
}

Submission Info

Judge Result