题解 | 序列中的排列

#include<bits/stdc++.h>
using namespace std;
int main() {
	int T;
	cin >> T;
	while (T--) {
		int n, k;
		int arr[101] = {0};
		int num[101] = {0};
		cin >> n >> k;
		for (int i = 0; i < n; i++) {
			cin >> arr[i];
			num[arr[i]]++;
		}
		int check = 0;
		for (int i = 1; i <= k; i++) {
			if (num[i] == 0) {
				check = 1;
				break;
			}
		}
		if (check)cout << "NO\n";
		else cout << "YES\n";
	}
	return 0;
}